./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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 32bit --witnessprinter.graph.data.programhash 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:30:47,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:30:47,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:30:47,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:30:47,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:30:47,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:30:47,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:30:47,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:30:47,660 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:30:47,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:30:47,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:30:47,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:30:47,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:30:47,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:30:47,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:30:47,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:30:47,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:30:47,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:30:47,668 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:30:47,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:30:47,669 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:30:47,670 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:30:47,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:30:47,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:30:47,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:30:47,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:30:47,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:30:47,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:30:47,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:30:47,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:30:47,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:30:47,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:30:47,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:30:47,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:30:47,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:30:47,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:30:47,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 17:30:47,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:30:47,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:30:47,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:30:47,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:30:47,690 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:30:47,691 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 17:30:47,691 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 17:30:47,691 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 17:30:47,691 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 17:30:47,691 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 17:30:47,691 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 17:30:47,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 17:30:47,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 17:30:47,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:30:47,693 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 17:30:47,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:30:47,694 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:30:47,694 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 17:30:47,697 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 17:30:47,697 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_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe [2018-11-18 17:30:47,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:30:47,727 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:30:47,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:30:47,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:30:47,731 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:30:47,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 17:30:47,776 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/data/8090cb49c/271dd374006142d4beaa8c1f549aaeca/FLAG12d980040 [2018-11-18 17:30:48,097 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:30:48,098 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 17:30:48,103 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/data/8090cb49c/271dd374006142d4beaa8c1f549aaeca/FLAG12d980040 [2018-11-18 17:30:48,112 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/data/8090cb49c/271dd374006142d4beaa8c1f549aaeca [2018-11-18 17:30:48,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:30:48,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:30:48,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:30:48,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:30:48,117 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:30:48,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88e9939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48, skipping insertion in model container [2018-11-18 17:30:48,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:30:48,147 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:30:48,274 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:30:48,276 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:30:48,297 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:30:48,305 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:30:48,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48 WrapperNode [2018-11-18 17:30:48,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:30:48,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:30:48,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:30:48,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:30:48,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:30:48,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:30:48,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:30:48,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:30:48,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... [2018-11-18 17:30:48,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:30:48,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:30:48,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:30:48,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:30:48,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:30:48,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:30:48,605 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:30:48,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:30:48 BoogieIcfgContainer [2018-11-18 17:30:48,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:30:48,606 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 17:30:48,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 17:30:48,608 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 17:30:48,608 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:30:48,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 05:30:48" (1/3) ... [2018-11-18 17:30:48,609 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1739dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:30:48, skipping insertion in model container [2018-11-18 17:30:48,609 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:30:48,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:30:48" (2/3) ... [2018-11-18 17:30:48,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1739dbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 05:30:48, skipping insertion in model container [2018-11-18 17:30:48,610 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 17:30:48,610 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:30:48" (3/3) ... [2018-11-18 17:30:48,611 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 17:30:48,644 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:30:48,644 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 17:30:48,644 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 17:30:48,645 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 17:30:48,645 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:30:48,645 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:30:48,645 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 17:30:48,645 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:30:48,645 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 17:30:48,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 17:30:48,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 17:30:48,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:48,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:48,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 17:30:48,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:48,676 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 17:30:48,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 17:30:48,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 17:30:48,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:48,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:48,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 17:30:48,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:48,683 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 32#L50true assume !(0 == mp_add_~b3~0 % 256); 29#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 24#L61-3true [2018-11-18 17:30:48,684 INFO L796 eck$LassoCheckResult]: Loop: 24#L61-3true assume true; 30#L61-1true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27#L70true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24#L61-3true [2018-11-18 17:30:48,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-18 17:30:48,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:48,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:48,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:48,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-18 17:30:48,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:48,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:48,824 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-18 17:30:48,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:48,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:30:48,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:30:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:30:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:30:48,838 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-18 17:30:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:30:48,990 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-18 17:30:48,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:30:48,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-18 17:30:48,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-18 17:30:48,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-18 17:30:49,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-18 17:30:49,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-18 17:30:49,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-18 17:30:49,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:30:49,001 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-18 17:30:49,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-18 17:30:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 17:30:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 17:30:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-18 17:30:49,022 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 17:30:49,022 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 17:30:49,022 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 17:30:49,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-18 17:30:49,024 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 17:30:49,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:49,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:49,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,025 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 131#L40 assume !(0 == mp_add_~a3~0 % 256); 128#L40-1 mp_add_~nb~0 := 4; 129#L50 assume !(0 == mp_add_~b3~0 % 256); 140#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 147#L61-3 assume true; 148#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 145#L64-1 [2018-11-18 17:30:49,025 INFO L796 eck$LassoCheckResult]: Loop: 145#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 134#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 138#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 120#L80-1 assume !(1 == mp_add_~i~0 % 256); 121#L81-1 assume !(2 == mp_add_~i~0 % 256); 126#L82-1 assume !(3 == mp_add_~i~0 % 256); 127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 153#L61-3 assume true; 170#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 167#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 168#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 136#L65-2 assume !(1 == mp_add_~i~0 % 256); 137#L66-1 assume !(2 == mp_add_~i~0 % 256); 144#L67-1 assume !(3 == mp_add_~i~0 % 256); 145#L64-1 [2018-11-18 17:30:49,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-18 17:30:49,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,146 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-18 17:30:49,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:30:49,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:30:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-18 17:30:49,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,223 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-18 17:30:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:30:49,223 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:30:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:30:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:30:49,224 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-18 17:30:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:30:49,454 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-18 17:30:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:30:49,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-18 17:30:49,457 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-18 17:30:49,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-18 17:30:49,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-18 17:30:49,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-18 17:30:49,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-18 17:30:49,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:30:49,460 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-18 17:30:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-18 17:30:49,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-18 17:30:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 17:30:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-18 17:30:49,466 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 17:30:49,466 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 17:30:49,466 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 17:30:49,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-18 17:30:49,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 17:30:49,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:49,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:49,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,468 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 359#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 360#L42 assume !(0 == mp_add_~a2~0 % 256); 386#L40-1 mp_add_~nb~0 := 4; 383#L50 assume !(0 == mp_add_~b3~0 % 256); 366#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 401#L61-3 assume true; 399#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 400#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 385#L64-1 [2018-11-18 17:30:49,468 INFO L796 eck$LassoCheckResult]: Loop: 385#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 358#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 364#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 345#L80-1 assume !(1 == mp_add_~i~0 % 256); 346#L81-1 assume !(2 == mp_add_~i~0 % 256); 351#L82-1 assume !(3 == mp_add_~i~0 % 256); 352#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 375#L61-3 assume true; 376#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 388#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 368#L65-2 assume !(1 == mp_add_~i~0 % 256); 391#L66-1 assume !(2 == mp_add_~i~0 % 256); 392#L67-1 assume !(3 == mp_add_~i~0 % 256); 385#L64-1 [2018-11-18 17:30:49,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-18 17:30:49,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,541 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-18 17:30:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:30:49,541 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:30:49,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-18 17:30:49,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,589 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-18 17:30:49,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:30:49,589 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:30:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:30:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:30:49,590 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 3 states. [2018-11-18 17:30:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:30:49,593 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-18 17:30:49,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:30:49,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 97 transitions. [2018-11-18 17:30:49,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 17:30:49,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 97 transitions. [2018-11-18 17:30:49,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-18 17:30:49,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-18 17:30:49,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 97 transitions. [2018-11-18 17:30:49,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:30:49,596 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-18 17:30:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 97 transitions. [2018-11-18 17:30:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-18 17:30:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 17:30:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2018-11-18 17:30:49,599 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-18 17:30:49,600 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-18 17:30:49,600 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 17:30:49,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 97 transitions. [2018-11-18 17:30:49,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 17:30:49,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:49,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:49,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,602 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 518#L40 assume !(0 == mp_add_~a3~0 % 256); 515#L40-1 mp_add_~nb~0 := 4; 516#L50 assume !(0 == mp_add_~b3~0 % 256); 526#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 539#L61-3 assume true; 576#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 575#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 574#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 573#L65-2 assume !(1 == mp_add_~i~0 % 256); 572#L66-1 assume !(2 == mp_add_~i~0 % 256); 569#L67-1 assume !(3 == mp_add_~i~0 % 256); 563#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 558#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 524#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 507#L80-1 assume !(1 == mp_add_~i~0 % 256); 508#L81-1 assume !(2 == mp_add_~i~0 % 256); 513#L82-1 assume !(3 == mp_add_~i~0 % 256); 514#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 535#L61-3 assume true; 536#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 540#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 527#L65 [2018-11-18 17:30:49,602 INFO L796 eck$LassoCheckResult]: Loop: 527#L65 assume !(0 == mp_add_~i~0 % 256); 528#L65-2 assume !(1 == mp_add_~i~0 % 256); 571#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 566#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 560#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 557#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 556#L76-1 assume !(0 == mp_add_~i~0 % 256); 554#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 552#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 550#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 549#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 548#L61-3 assume true; 546#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 547#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 527#L65 [2018-11-18 17:30:49,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 627082604, now seen corresponding path program 1 times [2018-11-18 17:30:49,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:30:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:30:49,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:30:49,692 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:30:49,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2033069955, now seen corresponding path program 1 times [2018-11-18 17:30:49,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,712 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-18 17:30:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:30:49,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:30:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:30:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:30:49,713 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-18 17:30:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:30:49,785 INFO L93 Difference]: Finished difference Result 86 states and 123 transitions. [2018-11-18 17:30:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:30:49,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 123 transitions. [2018-11-18 17:30:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-18 17:30:49,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 123 transitions. [2018-11-18 17:30:49,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-18 17:30:49,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-18 17:30:49,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 123 transitions. [2018-11-18 17:30:49,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:30:49,788 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 123 transitions. [2018-11-18 17:30:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 123 transitions. [2018-11-18 17:30:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-18 17:30:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 17:30:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2018-11-18 17:30:49,791 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 119 transitions. [2018-11-18 17:30:49,791 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 119 transitions. [2018-11-18 17:30:49,791 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 17:30:49,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 119 transitions. [2018-11-18 17:30:49,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-18 17:30:49,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:49,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:49,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:49,793 INFO L794 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 686#L40 assume !(0 == mp_add_~a3~0 % 256); 681#L40-1 mp_add_~nb~0 := 4; 682#L50 assume !(0 == mp_add_~b3~0 % 256); 692#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 701#L61-3 assume true; 702#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 693#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 694#L65-2 assume !(1 == mp_add_~i~0 % 256); 748#L66-1 assume !(2 == mp_add_~i~0 % 256); 746#L67-1 assume !(3 == mp_add_~i~0 % 256); 743#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 741#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 740#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 739#L80-1 assume !(1 == mp_add_~i~0 % 256); 738#L81-1 assume !(2 == mp_add_~i~0 % 256); 679#L82-1 assume !(3 == mp_add_~i~0 % 256); 680#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 707#L61-3 assume true; 705#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 706#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 731#L65 [2018-11-18 17:30:49,793 INFO L796 eck$LassoCheckResult]: Loop: 731#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 688#L65-2 assume !(1 == mp_add_~i~0 % 256); 689#L66-1 assume !(2 == mp_add_~i~0 % 256); 697#L67-1 assume !(3 == mp_add_~i~0 % 256); 698#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 685#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 690#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 673#L80-1 assume !(1 == mp_add_~i~0 % 256); 674#L81-1 assume !(2 == mp_add_~i~0 % 256); 703#L82-1 assume !(3 == mp_add_~i~0 % 256); 715#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 714#L61-3 assume true; 712#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 713#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 731#L65 [2018-11-18 17:30:49,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,793 INFO L82 PathProgramCache]: Analyzing trace with hash 627082604, now seen corresponding path program 2 times [2018-11-18 17:30:49,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:30:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:30:49,901 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:30:49,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:49,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1714230653, now seen corresponding path program 3 times [2018-11-18 17:30:49,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:49,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:30:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:49,975 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:30:49,976 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:30:49,976 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:30:49,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:30:49,976 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:30:49,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:30:49,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:30:49,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:30:49,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Loop [2018-11-18 17:30:49,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:30:49,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:30:49,989 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-18 17:30:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:30:50,003 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-18 17:30:50,010 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-18 17:30:50,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:30:50,186 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:50,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:30:50,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:30:50,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:30:50,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r0~0=0} Honda state: {ULTIMATE.start_mp_add_~r0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:50,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:30:50,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:30:50,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:30:50,211 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:50,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:30:50,226 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:50,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:30:50,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:30:51,780 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:30:51,782 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:30:51,782 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:30:51,782 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:30:51,782 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:30:51,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:30:51,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:30:51,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:30:51,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:30:51,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Loop [2018-11-18 17:30:51,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:30:51,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:30:51,783 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-18 17:30:51,784 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-18 17:30:51,786 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-18 17:30:51,792 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-18 17:30:51,954 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:30:51,957 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:30:51,958 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-18 17:30:51,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:30:51,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:30:51,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,962 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-18 17:30:51,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:30:51,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:30:51,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,964 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-18 17:30:51,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:30:51,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:30:51,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,973 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-18 17:30:51,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:30:51,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:30:51,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,978 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:30:51,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:30:51,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:51,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:51,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,980 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-18 17:30:51,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,981 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:51,981 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:51,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,987 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-18 17:30:51,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:51,989 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:51,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:51,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:51,993 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-18 17:30:51,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:51,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:51,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:51,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:51,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:51,996 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:51,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,001 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:30:52,001 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-18 17:30:52,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,003 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-18 17:30:52,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,005 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-18 17:30:52,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,006 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,017 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-18 17:30:52,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,025 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:30:52,025 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-18 17:30:52,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,027 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,028 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-18 17:30:52,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,029 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,030 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-18 17:30:52,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,031 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,032 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,043 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-18 17:30:52,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:30:52,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,051 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:30:52,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:30:52,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:52,053 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:52,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,054 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-18 17:30:52,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,055 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:52,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:52,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,057 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-18 17:30:52,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,057 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,057 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:52,059 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:52,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,069 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-18 17:30:52,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,069 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:30:52,071 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:30:52,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,077 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:30:52,077 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-18 17:30:52,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,078 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:30:52,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,078 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,081 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-18 17:30:52,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,081 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:30:52,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,084 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-18 17:30:52,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,085 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:30:52,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,097 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-18 17:30:52,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,098 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:30:52,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,101 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,112 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:30:52,112 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-18 17:30:52,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,112 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,118 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-18 17:30:52,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,119 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,120 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,125 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-18 17:30:52,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,126 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,149 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-18 17:30:52,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:30:52,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:30:52,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,163 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:30:52,164 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-18 17:30:52,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,165 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,165 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,167 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-18 17:30:52,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,167 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,170 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-18 17:30:52,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,179 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-18 17:30:52,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:30:52,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:30:52,181 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:30:52,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,190 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:30:52,191 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-18 17:30:52,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,191 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,192 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:30:52,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:30:52,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,195 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-18 17:30:52,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,195 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,196 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:30:52,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:30:52,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,200 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-18 17:30:52,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,201 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:30:52,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:30:52,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,222 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-18 17:30:52,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:30:52,222 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:30:52,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:30:52,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:30:52,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:30:52,223 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:30:52,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:30:52,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:30:52,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:30:52,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:30:52,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:30:52,243 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. cyclomatic complexity: 39 Second operand 6 states. [2018-11-18 17:30:52,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:30:52,462 INFO L93 Difference]: Finished difference Result 196 states and 288 transitions. [2018-11-18 17:30:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:30:52,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 288 transitions. [2018-11-18 17:30:52,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 [2018-11-18 17:30:52,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 288 transitions. [2018-11-18 17:30:52,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2018-11-18 17:30:52,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2018-11-18 17:30:52,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 288 transitions. [2018-11-18 17:30:52,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:30:52,468 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 288 transitions. [2018-11-18 17:30:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 288 transitions. [2018-11-18 17:30:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 116. [2018-11-18 17:30:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-18 17:30:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 159 transitions. [2018-11-18 17:30:52,475 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 159 transitions. [2018-11-18 17:30:52,475 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 159 transitions. [2018-11-18 17:30:52,475 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 17:30:52,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 159 transitions. [2018-11-18 17:30:52,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-18 17:30:52,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:30:52,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:30:52,477 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:52,477 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:30:52,477 INFO L794 eck$LassoCheckResult]: Stem: 1005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 975#L40 assume !(0 == mp_add_~a3~0 % 256); 972#L40-1 mp_add_~nb~0 := 4; 973#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1004#L52 assume !(0 == mp_add_~b2~0 % 256); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1033#L61-3 assume true; 1032#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1031#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1030#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1029#L65-2 assume !(1 == mp_add_~i~0 % 256); 1028#L66-1 assume !(2 == mp_add_~i~0 % 256); 1027#L67-1 assume !(3 == mp_add_~i~0 % 256); 1024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1026#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1063#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1062#L80-1 assume !(1 == mp_add_~i~0 % 256); 1061#L81-1 assume !(2 == mp_add_~i~0 % 256); 1060#L82-1 assume !(3 == mp_add_~i~0 % 256); 1059#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1058#L61-3 assume true; 1057#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1006#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1007#L65 [2018-11-18 17:30:52,477 INFO L796 eck$LassoCheckResult]: Loop: 1007#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1056#L65-2 assume !(1 == mp_add_~i~0 % 256); 1070#L66-1 assume !(2 == mp_add_~i~0 % 256); 1069#L67-1 assume !(3 == mp_add_~i~0 % 256); 1068#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 999#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 982#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 983#L80-1 assume !(1 == mp_add_~i~0 % 256); 1019#L81-1 assume !(2 == mp_add_~i~0 % 256); 1017#L82-1 assume !(3 == mp_add_~i~0 % 256); 1015#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1014#L61-3 assume true; 1012#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1013#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1007#L65 [2018-11-18 17:30:52,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:52,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1746132101, now seen corresponding path program 1 times [2018-11-18 17:30:52,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:52,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:52,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:52,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:30:52,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:30:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:30:52,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:30:52,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:30:52,543 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:30:52,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:30:52,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1714230653, now seen corresponding path program 4 times [2018-11-18 17:30:52,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:30:52,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:30:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:30:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:30:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:30:52,593 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:30:52,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:30:52,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:30:52,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:30:52,594 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:30:52,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:30:52,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:30:52,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:30:52,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-18 17:30:52,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:30:52,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:30:52,595 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-18 17:30:52,602 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-18 17:30:52,607 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-18 17:30:52,608 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-18 17:30:52,733 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:30:52,733 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:52,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:30:52,744 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:30:52,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:30:52,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:04,812 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 17:31:04,815 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:04,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:04,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:04,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:04,815 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:04,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:04,815 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:04,815 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:04,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-18 17:31:04,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:04,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:04,816 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-18 17:31:04,823 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-18 17:31:04,824 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-18 17:31:04,827 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-18 17:31:04,975 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:04,975 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:04,976 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-18 17:31:04,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:04,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:04,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,979 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-18 17:31:04,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:04,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:04,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:04,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:04,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:04,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,984 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-18 17:31:04,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:04,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:04,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,985 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:04,986 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-18 17:31:04,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:04,990 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:04,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,993 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-18 17:31:04,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:04,994 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:04,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,995 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-18 17:31:04,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:04,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:04,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:04,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:04,996 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:04,996 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:04,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:04,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:04,999 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-18 17:31:04,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,000 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:05,000 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:05,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,001 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:05,001 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-18 17:31:05,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,007 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-18 17:31:05,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,008 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,009 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-18 17:31:05,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,015 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-18 17:31:05,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,016 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:05,017 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-18 17:31:05,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,018 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,023 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-18 17:31:05,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,024 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,025 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-18 17:31:05,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,027 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,031 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-18 17:31:05,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:05,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,032 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,032 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,033 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:05,033 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-18 17:31:05,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,033 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,034 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:05,036 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:05,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:05,043 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:05,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,044 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-18 17:31:05,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:05,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:05,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,051 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-18 17:31:05,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,051 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,052 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:05,052 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:05,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,053 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:05,053 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-18 17:31:05,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,054 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:05,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,054 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,067 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-18 17:31:05,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,068 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:05,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,070 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-18 17:31:05,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,070 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:05,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,078 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:05,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,080 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:05,081 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-18 17:31:05,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,081 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,082 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,092 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,092 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,094 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-18 17:31:05,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,094 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,095 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:05,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:05,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,107 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:05,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,114 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-18 17:31:05,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,115 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,115 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,117 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,117 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,118 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,124 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:05,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:05,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:05,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,126 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:05,126 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-18 17:31:05,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,127 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:05,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:05,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,138 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-18 17:31:05,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,139 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:05,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:05,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:05,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,143 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:05,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:05,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,153 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-18 17:31:05,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:05,154 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:05,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:05,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:05,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:05,154 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:05,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:05,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:05,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:05,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:31:05,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:31:05,158 INFO L87 Difference]: Start difference. First operand 116 states and 159 transitions. cyclomatic complexity: 45 Second operand 7 states. [2018-11-18 17:31:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:05,627 INFO L93 Difference]: Finished difference Result 322 states and 459 transitions. [2018-11-18 17:31:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:31:05,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 459 transitions. [2018-11-18 17:31:05,630 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 229 [2018-11-18 17:31:05,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 322 states and 459 transitions. [2018-11-18 17:31:05,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2018-11-18 17:31:05,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2018-11-18 17:31:05,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 459 transitions. [2018-11-18 17:31:05,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:05,633 INFO L705 BuchiCegarLoop]: Abstraction has 322 states and 459 transitions. [2018-11-18 17:31:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 459 transitions. [2018-11-18 17:31:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 259. [2018-11-18 17:31:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-18 17:31:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 367 transitions. [2018-11-18 17:31:05,641 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 367 transitions. [2018-11-18 17:31:05,641 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 367 transitions. [2018-11-18 17:31:05,641 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 17:31:05,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 367 transitions. [2018-11-18 17:31:05,642 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 186 [2018-11-18 17:31:05,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:05,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:05,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:05,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:05,643 INFO L794 eck$LassoCheckResult]: Stem: 1462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1432#L40 assume !(0 == mp_add_~a3~0 % 256); 1428#L40-1 mp_add_~nb~0 := 4; 1429#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1459#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1440#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1441#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1451#L61-3 assume true; 1452#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1463#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1442#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1443#L65-2 assume !(1 == mp_add_~i~0 % 256); 1674#L66-1 assume !(2 == mp_add_~i~0 % 256); 1673#L67-1 assume !(3 == mp_add_~i~0 % 256); 1671#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1668#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1666#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1665#L80-1 assume !(1 == mp_add_~i~0 % 256); 1453#L81-1 assume !(2 == mp_add_~i~0 % 256); 1426#L82-1 assume !(3 == mp_add_~i~0 % 256); 1427#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1460#L61-3 assume true; 1455#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1456#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1659#L65 [2018-11-18 17:31:05,643 INFO L796 eck$LassoCheckResult]: Loop: 1659#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1436#L65-2 assume !(1 == mp_add_~i~0 % 256); 1437#L66-1 assume !(2 == mp_add_~i~0 % 256); 1446#L67-1 assume !(3 == mp_add_~i~0 % 256); 1447#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1434#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1438#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1439#L80-1 assume !(1 == mp_add_~i~0 % 256); 1598#L81-1 assume !(2 == mp_add_~i~0 % 256); 1595#L82-1 assume !(3 == mp_add_~i~0 % 256); 1566#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1468#L61-3 assume true; 1469#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1563#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1659#L65 [2018-11-18 17:31:05,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash -531929919, now seen corresponding path program 1 times [2018-11-18 17:31:05,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:05,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:05,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:05,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:05,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 17:31:05,709 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:31:05,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1714230653, now seen corresponding path program 5 times [2018-11-18 17:31:05,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:05,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:05,761 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:05,761 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:05,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:05,762 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:05,762 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:05,762 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:05,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:05,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:05,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-18 17:31:05,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:05,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:05,763 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-18 17:31:05,771 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-18 17:31:05,773 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-18 17:31:05,777 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-18 17:31:05,904 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:05,904 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:05,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:05,907 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:05,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:05,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:17,993 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 17:31:17,996 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:17,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:17,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:17,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:17,996 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:17,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:17,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:17,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:17,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-18 17:31:17,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:17,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:17,997 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-18 17:31:18,007 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-18 17:31:18,009 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-18 17:31:18,013 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-18 17:31:18,152 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:18,153 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:18,153 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-18 17:31:18,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:18,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:18,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,155 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-18 17:31:18,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:18,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:18,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,156 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-18 17:31:18,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:18,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:18,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,158 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-18 17:31:18,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:18,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:18,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,159 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:18,160 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-18 17:31:18,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,160 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,161 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,164 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-18 17:31:18,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,165 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,165 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-18 17:31:18,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,167 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,169 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-18 17:31:18,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,170 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,170 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,171 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:18,171 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-18 17:31:18,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,172 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,176 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-18 17:31:18,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,177 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-18 17:31:18,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,179 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,182 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-18 17:31:18,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,183 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,183 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:18,183 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-18 17:31:18,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,184 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,185 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,188 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-18 17:31:18,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,189 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,189 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,190 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-18 17:31:18,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,191 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,191 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,195 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-18 17:31:18,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:18,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,196 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,196 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,196 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:18,197 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-18 17:31:18,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,197 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,198 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,202 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-18 17:31:18,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,203 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,203 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,204 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,204 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-18 17:31:18,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,205 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,205 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,206 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,211 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-18 17:31:18,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:18,213 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:18,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,213 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:18,213 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-18 17:31:18,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,214 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:18,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,226 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-18 17:31:18,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,226 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:18,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,226 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,227 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,228 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-18 17:31:18,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,229 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:18,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,229 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,237 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-18 17:31:18,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,237 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:18,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,238 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,238 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,239 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:18,239 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-18 17:31:18,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,240 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,240 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,242 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,254 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-18 17:31:18,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,255 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,256 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,256 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-18 17:31:18,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,257 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,257 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,259 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,268 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-18 17:31:18,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,269 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:18,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:18,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,270 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:18,270 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-18 17:31:18,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,271 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,271 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,272 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,277 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-18 17:31:18,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,277 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,279 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-18 17:31:18,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,279 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,285 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-18 17:31:18,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:18,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:18,286 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:18,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,287 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:18,287 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-18 17:31:18,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,288 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:18,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:18,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,299 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-18 17:31:18,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,300 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:18,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:18,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,303 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-18 17:31:18,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,304 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:18,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:18,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,315 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-18 17:31:18,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:18,315 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:18,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:18,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:18,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:18,315 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:18,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:18,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:18,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 17:31:18,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:31:18,318 INFO L87 Difference]: Start difference. First operand 259 states and 367 transitions. cyclomatic complexity: 114 Second operand 9 states. [2018-11-18 17:31:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:18,881 INFO L93 Difference]: Finished difference Result 361 states and 500 transitions. [2018-11-18 17:31:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:31:18,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 500 transitions. [2018-11-18 17:31:18,883 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 266 [2018-11-18 17:31:18,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 361 states and 500 transitions. [2018-11-18 17:31:18,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 361 [2018-11-18 17:31:18,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 361 [2018-11-18 17:31:18,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 500 transitions. [2018-11-18 17:31:18,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:18,886 INFO L705 BuchiCegarLoop]: Abstraction has 361 states and 500 transitions. [2018-11-18 17:31:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 500 transitions. [2018-11-18 17:31:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 316. [2018-11-18 17:31:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 17:31:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 439 transitions. [2018-11-18 17:31:18,893 INFO L728 BuchiCegarLoop]: Abstraction has 316 states and 439 transitions. [2018-11-18 17:31:18,894 INFO L608 BuchiCegarLoop]: Abstraction has 316 states and 439 transitions. [2018-11-18 17:31:18,894 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 17:31:18,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 439 transitions. [2018-11-18 17:31:18,895 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 221 [2018-11-18 17:31:18,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:18,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:18,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:18,896 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:18,896 INFO L794 eck$LassoCheckResult]: Stem: 2106#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2075#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2072#L40 assume !(0 == mp_add_~a3~0 % 256); 2068#L40-1 mp_add_~nb~0 := 4; 2069#L50 assume !(0 == mp_add_~b3~0 % 256); 2102#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2287#L61-3 assume true; 2286#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2285#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2284#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2283#L65-2 assume !(1 == mp_add_~i~0 % 256); 2281#L66-1 assume !(2 == mp_add_~i~0 % 256); 2279#L67-1 assume !(3 == mp_add_~i~0 % 256); 2277#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2275#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2274#L71-2 assume !(1 == mp_add_~i~0 % 256); 2272#L72-1 assume !(2 == mp_add_~i~0 % 256); 2270#L73-1 assume !(3 == mp_add_~i~0 % 256); 2268#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2266#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2265#L80-1 assume !(1 == mp_add_~i~0 % 256); 2264#L81-1 assume !(2 == mp_add_~i~0 % 256); 2200#L82-1 assume !(3 == mp_add_~i~0 % 256); 2201#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2240#L61-3 assume true; 2241#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2232#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2228#L65 [2018-11-18 17:31:18,896 INFO L796 eck$LassoCheckResult]: Loop: 2228#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2229#L65-2 assume !(1 == mp_add_~i~0 % 256); 2282#L66-1 assume !(2 == mp_add_~i~0 % 256); 2280#L67-1 assume !(3 == mp_add_~i~0 % 256); 2278#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2276#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2219#L71-2 assume !(1 == mp_add_~i~0 % 256); 2273#L72-1 assume !(2 == mp_add_~i~0 % 256); 2271#L73-1 assume !(3 == mp_add_~i~0 % 256); 2269#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2267#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2211#L80-1 assume !(1 == mp_add_~i~0 % 256); 2205#L81-1 assume !(2 == mp_add_~i~0 % 256); 2263#L82-1 assume !(3 == mp_add_~i~0 % 256); 2254#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2255#L61-3 assume true; 2234#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2235#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2228#L65 [2018-11-18 17:31:18,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 1 times [2018-11-18 17:31:18,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:18,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:18,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1242836529, now seen corresponding path program 1 times [2018-11-18 17:31:18,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:18,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:18,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -638373050, now seen corresponding path program 1 times [2018-11-18 17:31:18,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:18,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:18,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:18,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:31:19,063 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:19,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:19,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:19,064 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:19,064 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:19,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:19,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:19,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:19,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-18 17:31:19,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:19,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:19,065 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-18 17:31:19,071 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-18 17:31:19,088 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-18 17:31:19,091 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-18 17:31:19,215 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-18 17:31:19,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:19,396 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:19,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:19,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:19,405 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:19,405 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:19,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:19,456 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:19,494 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:19,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:19,911 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:19,913 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:19,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:19,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:19,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:19,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:19,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:19,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:19,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:19,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-18 17:31:19,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:19,914 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:19,914 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-18 17:31:19,916 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-18 17:31:19,927 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-18 17:31:19,940 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-18 17:31:20,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:20,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:20,114 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-18 17:31:20,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:20,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:20,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,116 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-18 17:31:20,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:20,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:20,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,119 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-18 17:31:20,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:20,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:20,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,122 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-18 17:31:20,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:20,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:20,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,124 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:20,124 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-18 17:31:20,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,126 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-18 17:31:20,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,127 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,130 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-18 17:31:20,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,131 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,131 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,135 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-18 17:31:20,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,136 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,136 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:20,136 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-18 17:31:20,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,137 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,138 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-18 17:31:20,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,139 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,143 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-18 17:31:20,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,144 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,148 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-18 17:31:20,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,149 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,149 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:20,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:20,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,151 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,151 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-18 17:31:20,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:20,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,163 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-18 17:31:20,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:20,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,164 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,164 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,165 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:20,165 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-18 17:31:20,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,165 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,166 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,167 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-18 17:31:20,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,167 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,167 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,168 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,174 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-18 17:31:20,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,175 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,176 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,181 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-18 17:31:20,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,181 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:20,182 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:20,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,182 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:20,182 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-18 17:31:20,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,183 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:20,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,185 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-18 17:31:20,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,185 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:20,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,197 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-18 17:31:20,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,197 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:20,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,197 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,206 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-18 17:31:20,207 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,207 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:20,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,208 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:20,209 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-18 17:31:20,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,209 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,210 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,211 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-18 17:31:20,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,211 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,212 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,214 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,227 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-18 17:31:20,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,228 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,231 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,243 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-18 17:31:20,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:20,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:20,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,245 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:20,245 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-18 17:31:20,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,246 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,246 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,246 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,248 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-18 17:31:20,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,249 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,255 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-18 17:31:20,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,255 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,264 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-18 17:31:20,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,264 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:20,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:20,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:20,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,266 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:20,266 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-18 17:31:20,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,267 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,267 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:20,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:20,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,269 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-18 17:31:20,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,270 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,270 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:20,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:20,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,280 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-18 17:31:20,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,281 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,281 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:20,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:20,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,293 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-18 17:31:20,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:20,294 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:20,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:20,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:20,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:20,294 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:20,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:20,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:20,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:31:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:31:20,296 INFO L87 Difference]: Start difference. First operand 316 states and 439 transitions. cyclomatic complexity: 130 Second operand 4 states. [2018-11-18 17:31:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:20,469 INFO L93 Difference]: Finished difference Result 461 states and 646 transitions. [2018-11-18 17:31:20,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:31:20,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 646 transitions. [2018-11-18 17:31:20,473 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 365 [2018-11-18 17:31:20,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 460 states and 644 transitions. [2018-11-18 17:31:20,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 460 [2018-11-18 17:31:20,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2018-11-18 17:31:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 460 states and 644 transitions. [2018-11-18 17:31:20,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:20,476 INFO L705 BuchiCegarLoop]: Abstraction has 460 states and 644 transitions. [2018-11-18 17:31:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states and 644 transitions. [2018-11-18 17:31:20,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 413. [2018-11-18 17:31:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-11-18 17:31:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-11-18 17:31:20,487 INFO L728 BuchiCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-11-18 17:31:20,487 INFO L608 BuchiCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-11-18 17:31:20,487 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 17:31:20,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 413 states and 570 transitions. [2018-11-18 17:31:20,489 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 318 [2018-11-18 17:31:20,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:20,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:20,490 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:20,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:20,492 INFO L794 eck$LassoCheckResult]: Stem: 2889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2857#L40 assume !(0 == mp_add_~a3~0 % 256); 2854#L40-1 mp_add_~nb~0 := 4; 2855#L50 assume !(0 == mp_add_~b3~0 % 256); 2881#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2882#L61-3 assume true; 3218#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2890#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2867#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2868#L65-2 assume !(1 == mp_add_~i~0 % 256); 3233#L66-1 assume !(2 == mp_add_~i~0 % 256); 3232#L67-1 assume !(3 == mp_add_~i~0 % 256); 3231#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3230#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3229#L71-2 assume !(1 == mp_add_~i~0 % 256); 3228#L72-1 assume !(2 == mp_add_~i~0 % 256); 3227#L73-1 assume !(3 == mp_add_~i~0 % 256); 3226#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3225#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3224#L80-1 assume !(1 == mp_add_~i~0 % 256); 3223#L81-1 assume !(2 == mp_add_~i~0 % 256); 3222#L82-1 assume !(3 == mp_add_~i~0 % 256); 3220#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3221#L61-3 assume true; 3215#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3216#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3219#L65 [2018-11-18 17:31:20,492 INFO L796 eck$LassoCheckResult]: Loop: 3219#L65 assume !(0 == mp_add_~i~0 % 256); 3217#L65-2 assume !(1 == mp_add_~i~0 % 256); 3213#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 3212#L67-1 assume !(3 == mp_add_~i~0 % 256); 3208#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3206#L71 assume !(0 == mp_add_~i~0 % 256); 3202#L71-2 assume !(1 == mp_add_~i~0 % 256); 3199#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 3200#L73-1 assume !(3 == mp_add_~i~0 % 256); 3255#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3182#L76-1 assume !(0 == mp_add_~i~0 % 256); 3180#L80-1 assume !(1 == mp_add_~i~0 % 256); 3101#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 3099#L82-1 assume !(3 == mp_add_~i~0 % 256); 2902#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2903#L61-3 assume true; 3028#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3029#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3188#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3183#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3184#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3249#L80-1 assume !(1 == mp_add_~i~0 % 256); 3247#L81-1 assume !(2 == mp_add_~i~0 % 256); 3246#L82-1 assume !(3 == mp_add_~i~0 % 256); 2886#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2875#L61-3 assume true; 2876#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2883#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3219#L65 [2018-11-18 17:31:20,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 2 times [2018-11-18 17:31:20,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:20,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:20,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:20,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -845449443, now seen corresponding path program 1 times [2018-11-18 17:31:20,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:20,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:20,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:20,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:20,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:20,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:20,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:20,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:20,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-18 17:31:20,664 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:31:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:31:20,664 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. cyclomatic complexity: 164 Second operand 7 states. [2018-11-18 17:31:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:20,984 INFO L93 Difference]: Finished difference Result 805 states and 1044 transitions. [2018-11-18 17:31:20,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:31:20,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 805 states and 1044 transitions. [2018-11-18 17:31:20,989 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 672 [2018-11-18 17:31:20,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 805 states to 802 states and 1041 transitions. [2018-11-18 17:31:20,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 802 [2018-11-18 17:31:20,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 802 [2018-11-18 17:31:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 802 states and 1041 transitions. [2018-11-18 17:31:20,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:20,994 INFO L705 BuchiCegarLoop]: Abstraction has 802 states and 1041 transitions. [2018-11-18 17:31:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states and 1041 transitions. [2018-11-18 17:31:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 539. [2018-11-18 17:31:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-18 17:31:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 705 transitions. [2018-11-18 17:31:21,004 INFO L728 BuchiCegarLoop]: Abstraction has 539 states and 705 transitions. [2018-11-18 17:31:21,004 INFO L608 BuchiCegarLoop]: Abstraction has 539 states and 705 transitions. [2018-11-18 17:31:21,004 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 17:31:21,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 539 states and 705 transitions. [2018-11-18 17:31:21,006 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 431 [2018-11-18 17:31:21,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:21,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:21,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:21,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:21,007 INFO L794 eck$LassoCheckResult]: Stem: 4220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4186#L40 assume !(0 == mp_add_~a3~0 % 256); 4182#L40-1 mp_add_~nb~0 := 4; 4183#L50 assume !(0 == mp_add_~b3~0 % 256); 4205#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4206#L61-3 assume true; 4645#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4662#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4661#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4660#L65-2 assume !(1 == mp_add_~i~0 % 256); 4659#L66-1 assume !(2 == mp_add_~i~0 % 256); 4658#L67-1 assume !(3 == mp_add_~i~0 % 256); 4657#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4656#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4655#L71-2 assume !(1 == mp_add_~i~0 % 256); 4654#L72-1 assume !(2 == mp_add_~i~0 % 256); 4653#L73-1 assume !(3 == mp_add_~i~0 % 256); 4652#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4651#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4650#L80-1 assume !(1 == mp_add_~i~0 % 256); 4649#L81-1 assume !(2 == mp_add_~i~0 % 256); 4648#L82-1 assume !(3 == mp_add_~i~0 % 256); 4646#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4647#L61-3 assume true; 4207#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4208#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4639#L65 [2018-11-18 17:31:21,007 INFO L796 eck$LassoCheckResult]: Loop: 4639#L65 assume !(0 == mp_add_~i~0 % 256); 4644#L65-2 assume !(1 == mp_add_~i~0 % 256); 4641#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4615#L67-1 assume !(3 == mp_add_~i~0 % 256); 4664#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4663#L71 assume !(0 == mp_add_~i~0 % 256); 4636#L71-2 assume !(1 == mp_add_~i~0 % 256); 4633#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 4631#L73-1 assume !(3 == mp_add_~i~0 % 256); 4629#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4627#L76-1 assume !(0 == mp_add_~i~0 % 256); 4625#L80-1 assume !(1 == mp_add_~i~0 % 256); 4623#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4622#L82-1 assume !(3 == mp_add_~i~0 % 256); 4621#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4619#L61-3 assume true; 4616#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4612#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4608#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4607#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4675#L71-2 assume !(1 == mp_add_~i~0 % 256); 4674#L72-1 assume !(2 == mp_add_~i~0 % 256); 4673#L73-1 assume !(3 == mp_add_~i~0 % 256); 4672#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4669#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4670#L80-1 assume !(1 == mp_add_~i~0 % 256); 4683#L81-1 assume !(2 == mp_add_~i~0 % 256); 4682#L82-1 assume !(3 == mp_add_~i~0 % 256); 4681#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4202#L61-3 assume true; 4203#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4638#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4639#L65 [2018-11-18 17:31:21,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 3 times [2018-11-18 17:31:21,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:21,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:21,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:21,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2096594583, now seen corresponding path program 1 times [2018-11-18 17:31:21,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:21,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:21,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:21,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:21,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:21,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:21,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:21,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:31:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-18 17:31:21,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:31:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:31:21,248 INFO L87 Difference]: Start difference. First operand 539 states and 705 transitions. cyclomatic complexity: 175 Second operand 7 states. [2018-11-18 17:31:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:21,768 INFO L93 Difference]: Finished difference Result 1812 states and 2341 transitions. [2018-11-18 17:31:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 17:31:21,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1812 states and 2341 transitions. [2018-11-18 17:31:21,775 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1583 [2018-11-18 17:31:21,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1812 states to 1782 states and 2305 transitions. [2018-11-18 17:31:21,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1782 [2018-11-18 17:31:21,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1782 [2018-11-18 17:31:21,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1782 states and 2305 transitions. [2018-11-18 17:31:21,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:21,781 INFO L705 BuchiCegarLoop]: Abstraction has 1782 states and 2305 transitions. [2018-11-18 17:31:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states and 2305 transitions. [2018-11-18 17:31:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1025. [2018-11-18 17:31:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-18 17:31:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1359 transitions. [2018-11-18 17:31:21,794 INFO L728 BuchiCegarLoop]: Abstraction has 1025 states and 1359 transitions. [2018-11-18 17:31:21,794 INFO L608 BuchiCegarLoop]: Abstraction has 1025 states and 1359 transitions. [2018-11-18 17:31:21,794 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 17:31:21,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1025 states and 1359 transitions. [2018-11-18 17:31:21,797 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 920 [2018-11-18 17:31:21,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:21,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:21,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:21,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:21,798 INFO L794 eck$LassoCheckResult]: Stem: 6711#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6675#L40 assume !(0 == mp_add_~a3~0 % 256); 6671#L40-1 mp_add_~nb~0 := 4; 6672#L50 assume !(0 == mp_add_~b3~0 % 256); 6706#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6726#L61-3 assume true; 6727#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6723#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7251#L65-2 assume !(1 == mp_add_~i~0 % 256); 7250#L66-1 assume !(2 == mp_add_~i~0 % 256); 7249#L67-1 assume !(3 == mp_add_~i~0 % 256); 7248#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7247#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7246#L71-2 assume !(1 == mp_add_~i~0 % 256); 7245#L72-1 assume !(2 == mp_add_~i~0 % 256); 7244#L73-1 assume !(3 == mp_add_~i~0 % 256); 7243#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7242#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7241#L80-1 assume !(1 == mp_add_~i~0 % 256); 7240#L81-1 assume !(2 == mp_add_~i~0 % 256); 7239#L82-1 assume !(3 == mp_add_~i~0 % 256); 7238#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7237#L61-3 assume true; 7236#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7235#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7226#L65 [2018-11-18 17:31:21,798 INFO L796 eck$LassoCheckResult]: Loop: 7226#L65 assume !(0 == mp_add_~i~0 % 256); 7230#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 7231#L66-1 assume !(2 == mp_add_~i~0 % 256); 7325#L67-1 assume !(3 == mp_add_~i~0 % 256); 7323#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7321#L71 assume !(0 == mp_add_~i~0 % 256); 7318#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 7316#L72-1 assume !(2 == mp_add_~i~0 % 256); 7314#L73-1 assume !(3 == mp_add_~i~0 % 256); 7312#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7310#L76-1 assume !(0 == mp_add_~i~0 % 256); 7307#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7306#L81-1 assume !(2 == mp_add_~i~0 % 256); 7305#L82-1 assume !(3 == mp_add_~i~0 % 256); 7255#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7253#L61-3 assume true; 7234#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7225#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7226#L65 [2018-11-18 17:31:21,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 4 times [2018-11-18 17:31:21,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:21,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash -782991477, now seen corresponding path program 1 times [2018-11-18 17:31:21,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:21,819 INFO L82 PathProgramCache]: Analyzing trace with hash -178527998, now seen corresponding path program 1 times [2018-11-18 17:31:21,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:21,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:21,904 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:21,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:21,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:21,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:21,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:21,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:21,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:21,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:21,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2018-11-18 17:31:21,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:21,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:21,905 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-18 17:31:21,911 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-18 17:31:21,918 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-18 17:31:21,925 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-18 17:31:22,037 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-18 17:31:22,146 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:22,146 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:22,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:22,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:22,154 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:22,154 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:22,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:22,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:22,213 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:22,213 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~b1~0=-65281, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=32768} Honda state: {ULTIMATE.start_mp_add_~b1~0=-65281, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=32768} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:22,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:22,231 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:22,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:22,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:22,583 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:22,585 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:22,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:22,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:22,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:22,585 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:22,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:22,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:22,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:22,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2018-11-18 17:31:22,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:22,586 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:22,586 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-18 17:31:22,591 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-18 17:31:22,592 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-18 17:31:22,595 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-18 17:31:22,791 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:22,791 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:22,791 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-18 17:31:22,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:22,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:22,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,793 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-18 17:31:22,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:22,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:22,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,794 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-18 17:31:22,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:22,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:22,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,797 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-18 17:31:22,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:22,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:22,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,800 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:22,800 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-18 17:31:22,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,801 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-18 17:31:22,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,802 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,802 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:22,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,804 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,806 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-18 17:31:22,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,807 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,810 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:22,810 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-18 17:31:22,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,811 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-18 17:31:22,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,813 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-18 17:31:22,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,817 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-18 17:31:22,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,821 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:22,821 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-18 17:31:22,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,822 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,823 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-18 17:31:22,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,823 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,824 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-18 17:31:22,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,830 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-18 17:31:22,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:22,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,831 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,831 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,835 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:22,835 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-18 17:31:22,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,836 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,837 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-18 17:31:22,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,837 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,837 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,838 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-18 17:31:22,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,838 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,840 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,845 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-18 17:31:22,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,845 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,846 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:22,846 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:22,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,850 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:22,850 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-18 17:31:22,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,851 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:22,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,852 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-18 17:31:22,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,853 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:22,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,854 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-18 17:31:22,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,855 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:22,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,857 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,863 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-18 17:31:22,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,864 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:22,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,873 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:22,874 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-18 17:31:22,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,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-18 17:31:22,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,877 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,877 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,878 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-18 17:31:22,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,878 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,893 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-18 17:31:22,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:22,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:22,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,904 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:22,904 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-18 17:31:22,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,905 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,907 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-18 17:31:22,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,908 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-18 17:31:22,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,909 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,910 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,915 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-18 17:31:22,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:22,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:22,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:22,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,921 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:22,921 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-18 17:31:22,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,921 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:22,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:22,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,924 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-18 17:31:22,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,924 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,925 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:22,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:22,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,927 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-18 17:31:22,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,928 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:22,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:22,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:22,937 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-18 17:31:22,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:22,938 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:22,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:22,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:22,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:22,938 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:22,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:22,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:22,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:23,315 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-11-18 17:31:23,348 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:23,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:23,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:23,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:23,348 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:23,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:23,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:23,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:23,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Lasso [2018-11-18 17:31:23,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:23,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:23,350 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-18 17:31:23,356 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-18 17:31:23,357 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-18 17:31:23,358 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-18 17:31:23,359 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-18 17:31:23,361 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-18 17:31:23,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-18 17:31:23,373 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-18 17:31:23,410 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-18 17:31:23,411 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-18 17:31:23,412 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-18 17:31:23,413 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-18 17:31:23,862 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2018-11-18 17:31:24,104 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-18 17:31:24,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:24,139 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:24,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,145 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:24,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,162 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret1=0} Honda state: {ULTIMATE.start_main_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:24,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,180 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,180 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:24,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,198 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,198 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~r~1=0} Honda state: {ULTIMATE.start_main_~r~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/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-18 17:31:24,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:24,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:24,234 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r2~0=0} Honda state: {ULTIMATE.start_mp_add_~r2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:24,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:24,252 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:24,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:24,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:24,804 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:24,806 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:24,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:24,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:24,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:24,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:24,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:24,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:24,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:24,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Lasso [2018-11-18 17:31:24,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:24,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:24,808 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-18 17:31:24,810 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-18 17:31:24,811 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-18 17:31:24,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:31:24,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:31:24,813 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-18 17:31:24,821 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-18 17:31:24,822 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-18 17:31:24,824 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-18 17:31:24,825 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-18 17:31:24,825 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-18 17:31:24,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:31:25,508 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2018-11-18 17:31:25,722 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-18 17:31:25,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:25,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:25,763 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-18 17:31:25,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:25,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,765 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-18 17:31:25,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:25,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:25,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,769 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-18 17:31:25,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:25,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:31:25,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,781 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-18 17:31:25,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,782 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-18 17:31:25,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:25,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:31:25,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,784 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-18 17:31:25,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,786 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-18 17:31:25,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,787 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-18 17:31:25,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:25,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 17:31:25,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,816 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-18 17:31:25,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:25,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:25,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,818 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:25,818 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-18 17:31:25,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,819 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,819 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-18 17:31:25,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,821 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-18 17:31:25,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,821 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,822 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-18 17:31:25,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,822 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,823 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,823 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-18 17:31:25,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,824 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,824 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-18 17:31:25,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,826 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:25,826 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:25,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,836 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-18 17:31:25,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,837 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,838 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-18 17:31:25,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,838 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,839 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:25,839 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:25,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,840 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-18 17:31:25,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,841 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,841 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,841 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-18 17:31:25,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,842 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,843 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-18 17:31:25,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,843 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,846 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:25,847 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:25,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,865 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-18 17:31:25,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,866 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:25,866 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:25,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,866 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:25,867 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-18 17:31:25,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,868 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-18 17:31:25,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,869 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-18 17:31:25,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,870 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,871 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-18 17:31:25,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,871 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,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-18 17:31:25,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,872 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,873 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-18 17:31:25,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,875 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:25,875 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:25,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,898 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-18 17:31:25,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,900 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-18 17:31:25,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,901 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:25,901 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:25,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,903 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-18 17:31:25,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,905 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-18 17:31:25,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,906 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-18 17:31:25,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,911 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:25,911 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:25,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,943 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-18 17:31:25,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:25,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:25,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,944 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:25,945 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-18 17:31:25,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,945 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,946 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-18 17:31:25,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,948 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-18 17:31:25,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,950 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-18 17:31:25,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,952 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,952 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,953 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-18 17:31:25,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,955 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-18 17:31:25,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,955 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,957 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:25,957 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:25,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,974 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-18 17:31:25,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,975 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,975 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-18 17:31:25,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,976 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:25,977 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:25,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,980 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-18 17:31:25,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:25,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:25,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,982 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,982 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:25,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:25,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:25,983 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-18 17:31:25,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:25,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:25,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:25,983 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:25,988 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:25,988 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:26,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,020 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-18 17:31:26,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:26,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,022 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:26,022 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-18 17:31:26,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,022 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,023 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,023 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,024 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-18 17:31:26,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,024 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,024 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,024 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,025 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-18 17:31:26,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,026 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,026 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,027 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-18 17:31:26,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,027 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,027 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,028 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,028 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-18 17:31:26,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,029 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,029 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,030 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-18 17:31:26,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,031 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,032 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,033 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:26,033 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:26,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:26,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,060 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,060 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,061 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-18 17:31:26,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,061 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,061 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,062 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:26,062 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:26,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,064 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-18 17:31:26,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,064 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,065 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,065 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:26,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,067 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,067 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-18 17:31:26,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,068 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,072 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 17:31:26,072 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 17:31:26,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,182 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-18 17:31:26,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,183 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:26,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:26,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,184 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:26,184 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-18 17:31:26,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,185 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,185 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,190 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-18 17:31:26,190 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,190 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,200 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-18 17:31:26,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,200 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,202 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-18 17:31:26,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,204 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,205 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,206 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-18 17:31:26,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,206 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,207 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,208 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-18 17:31:26,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,208 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,215 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,215 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,267 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-18 17:31:26,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,268 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,268 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,268 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,269 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-18 17:31:26,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,270 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,270 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,271 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,271 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,273 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-18 17:31:26,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,274 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,276 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,277 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-18 17:31:26,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,277 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,279 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-18 17:31:26,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,279 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,286 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,286 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,352 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-18 17:31:26,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,353 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:26,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,353 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,354 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:26,354 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-18 17:31:26,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,356 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,356 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-18 17:31:26,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,357 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,357 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,358 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-18 17:31:26,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,359 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,359 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,359 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,360 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-18 17:31:26,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,361 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,361 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,364 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-18 17:31:26,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,365 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,366 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,366 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-18 17:31:26,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,367 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,367 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,371 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:26,371 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:26,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,390 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-18 17:31:26,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,390 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,391 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,391 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,392 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-18 17:31:26,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,392 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,394 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:26,394 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:26,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,398 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-18 17:31:26,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,399 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,399 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,400 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-18 17:31:26,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,401 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,401 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,402 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,402 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-18 17:31:26,403 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,403 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,412 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 17:31:26,413 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 17:31:26,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,553 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-18 17:31:26,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,554 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:26,555 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:26,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,556 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:26,556 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-18 17:31:26,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,556 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,557 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,558 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-18 17:31:26,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,559 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,560 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-18 17:31:26,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,560 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,561 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,562 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-18 17:31:26,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,563 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,564 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-18 17:31:26,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,565 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,566 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-18 17:31:26,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,567 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,569 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,569 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,604 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-18 17:31:26,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,604 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,605 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,606 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-18 17:31:26,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,607 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,607 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,608 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,608 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,610 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-18 17:31:26,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,611 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,613 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-18 17:31:26,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,615 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-18 17:31:26,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,615 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,619 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 17:31:26,620 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 17:31:26,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,665 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-18 17:31:26,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,665 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:26,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:26,666 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:26,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,667 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:26,667 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-18 17:31:26,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,667 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,669 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-18 17:31:26,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,670 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,670 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,672 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-18 17:31:26,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,672 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,672 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,674 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-18 17:31:26,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,675 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,676 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-18 17:31:26,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,677 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,677 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,679 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-18 17:31:26,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,680 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,682 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 17:31:26,683 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 17:31:26,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,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-18 17:31:26,729 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,729 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,729 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,731 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-18 17:31:26,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,731 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,731 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,732 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 17:31:26,732 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 17:31:26,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,737 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-18 17:31:26,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,737 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,737 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,740 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-18 17:31:26,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,742 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-18 17:31:26,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,743 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,752 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 17:31:26,752 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 17:31:26,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,832 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-18 17:31:26,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:26,832 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:26,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:26,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:26,832 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:26,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:26,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:26,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:26,835 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-18 17:31:26,835 INFO L794 eck$LassoCheckResult]: Stem: 6711#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6675#L40 assume !(0 == mp_add_~a3~0 % 256); 6671#L40-1 mp_add_~nb~0 := 4; 6672#L50 assume !(0 == mp_add_~b3~0 % 256); 6706#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6726#L61-3 assume true; 6727#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6723#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7251#L65-2 assume !(1 == mp_add_~i~0 % 256); 7250#L66-1 assume !(2 == mp_add_~i~0 % 256); 7249#L67-1 assume !(3 == mp_add_~i~0 % 256); 7248#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7247#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7246#L71-2 assume !(1 == mp_add_~i~0 % 256); 7245#L72-1 assume !(2 == mp_add_~i~0 % 256); 7244#L73-1 assume !(3 == mp_add_~i~0 % 256); 7243#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7242#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7241#L80-1 assume !(1 == mp_add_~i~0 % 256); 7240#L81-1 assume !(2 == mp_add_~i~0 % 256); 7239#L82-1 assume !(3 == mp_add_~i~0 % 256); 7238#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7237#L61-3 assume true; 7236#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7235#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7226#L65 assume !(0 == mp_add_~i~0 % 256); 7230#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 7231#L66-1 assume !(2 == mp_add_~i~0 % 256); 7325#L67-1 assume !(3 == mp_add_~i~0 % 256); 7323#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7321#L71 assume !(0 == mp_add_~i~0 % 256); 7318#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 7316#L72-1 assume !(2 == mp_add_~i~0 % 256); 7314#L73-1 assume !(3 == mp_add_~i~0 % 256); 7312#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7310#L76-1 assume !(0 == mp_add_~i~0 % 256); 7307#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7306#L81-1 assume !(2 == mp_add_~i~0 % 256); 7305#L82-1 assume !(3 == mp_add_~i~0 % 256); 7255#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7253#L61-3 assume true; 7234#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7225#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7226#L65 [2018-11-18 17:31:26,835 INFO L796 eck$LassoCheckResult]: Loop: 7226#L65 assume !(0 == mp_add_~i~0 % 256); 7230#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 7231#L66-1 assume !(2 == mp_add_~i~0 % 256); 7325#L67-1 assume !(3 == mp_add_~i~0 % 256); 7323#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7321#L71 assume !(0 == mp_add_~i~0 % 256); 7318#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 7316#L72-1 assume !(2 == mp_add_~i~0 % 256); 7314#L73-1 assume !(3 == mp_add_~i~0 % 256); 7312#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7310#L76-1 assume !(0 == mp_add_~i~0 % 256); 7307#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7306#L81-1 assume !(2 == mp_add_~i~0 % 256); 7305#L82-1 assume !(3 == mp_add_~i~0 % 256); 7255#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7253#L61-3 assume true; 7234#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7225#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7226#L65 [2018-11-18 17:31:26,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash -178527998, now seen corresponding path program 2 times [2018-11-18 17:31:26,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:26,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:26,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:26,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:26,864 INFO L82 PathProgramCache]: Analyzing trace with hash -782991477, now seen corresponding path program 2 times [2018-11-18 17:31:26,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:26,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:26,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:26,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash -746290612, now seen corresponding path program 3 times [2018-11-18 17:31:26,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:26,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 17:31:27,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:27,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:31:27,098 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:27,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:27,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:27,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:27,098 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:27,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:27,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:27,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2018-11-18 17:31:27,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:27,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:27,099 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-18 17:31:27,100 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-18 17:31:27,101 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-18 17:31:27,105 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-18 17:31:27,267 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:27,267 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:27,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:27,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:27,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:27,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:27,291 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:27,291 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:27,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:27,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:27,351 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~b1~0=0, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=-57089} Honda state: {ULTIMATE.start_mp_add_~b1~0=0, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=-57089} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:27,367 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:27,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:27,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:28,224 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:28,226 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:28,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:28,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:28,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:28,226 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:28,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:28,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:28,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:28,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2018-11-18 17:31:28,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:28,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:28,227 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-18 17:31:28,228 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-18 17:31:28,232 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-18 17:31:28,234 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-18 17:31:28,401 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:28,401 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:28,401 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-18 17:31:28,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:28,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:28,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,403 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-18 17:31:28,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:28,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:28,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,406 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-18 17:31:28,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:28,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:28,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,408 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-18 17:31:28,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:28,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:28,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,411 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:28,411 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-18 17:31:28,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,411 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,412 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,412 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-18 17:31:28,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,413 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,414 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,417 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-18 17:31:28,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,417 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,418 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,418 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-18 17:31:28,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,422 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:28,422 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-18 17:31:28,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,423 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,424 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-18 17:31:28,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,425 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,429 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-18 17:31:28,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,430 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,430 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,431 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-18 17:31:28,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,432 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,435 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:28,435 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-18 17:31:28,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,436 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,437 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-18 17:31:28,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,438 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,439 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,443 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-18 17:31:28,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,444 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,444 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,445 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-18 17:31:28,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:28,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,446 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,446 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,450 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:28,451 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-18 17:31:28,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,451 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,451 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,452 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,452 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-18 17:31:28,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,454 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,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-18 17:31:28,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,461 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,462 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,462 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,463 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-18 17:31:28,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,463 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:28,464 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:28,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,470 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:28,470 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-18 17:31:28,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,471 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:28,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,472 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,473 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-18 17:31:28,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,473 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:28,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,474 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,475 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,484 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-18 17:31:28,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,485 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:28,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,485 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,487 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-18 17:31:28,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,487 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:28,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,591 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:28,591 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-18 17:31:28,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,592 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,592 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,593 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,593 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-18 17:31:28,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,594 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,596 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,607 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-18 17:31:28,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,607 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,608 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,609 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-18 17:31:28,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,610 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,610 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:28,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:28,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,628 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:28,628 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-18 17:31:28,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,629 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,633 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-18 17:31:28,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,634 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,640 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-18 17:31:28,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,643 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-18 17:31:28,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,643 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:28,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,643 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:28,644 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:28,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,652 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:28,653 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-18 17:31:28,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,653 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:28,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:28,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,655 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-18 17:31:28,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,656 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:28,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:28,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,668 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-18 17:31:28,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,668 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:28,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:28,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,671 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-18 17:31:28,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:28,671 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:28,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:28,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:28,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:28,671 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:28,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:28,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:28,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:28,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:31:28,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:31:28,683 INFO L87 Difference]: Start difference. First operand 1025 states and 1359 transitions. cyclomatic complexity: 349 Second operand 5 states. [2018-11-18 17:31:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:28,980 INFO L93 Difference]: Finished difference Result 1442 states and 1818 transitions. [2018-11-18 17:31:28,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:31:28,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1818 transitions. [2018-11-18 17:31:28,987 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1327 [2018-11-18 17:31:28,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 1442 states and 1818 transitions. [2018-11-18 17:31:28,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1442 [2018-11-18 17:31:28,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1442 [2018-11-18 17:31:28,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1442 states and 1818 transitions. [2018-11-18 17:31:28,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:28,995 INFO L705 BuchiCegarLoop]: Abstraction has 1442 states and 1818 transitions. [2018-11-18 17:31:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states and 1818 transitions. [2018-11-18 17:31:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1010. [2018-11-18 17:31:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1010 states. [2018-11-18 17:31:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1272 transitions. [2018-11-18 17:31:29,012 INFO L728 BuchiCegarLoop]: Abstraction has 1010 states and 1272 transitions. [2018-11-18 17:31:29,012 INFO L608 BuchiCegarLoop]: Abstraction has 1010 states and 1272 transitions. [2018-11-18 17:31:29,012 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 17:31:29,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1010 states and 1272 transitions. [2018-11-18 17:31:29,016 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 905 [2018-11-18 17:31:29,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:29,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:29,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,017 INFO L794 eck$LassoCheckResult]: Stem: 9197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9164#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 9161#L40 assume !(0 == mp_add_~a3~0 % 256); 9157#L40-1 mp_add_~nb~0 := 4; 9158#L50 assume !(0 == mp_add_~b3~0 % 256); 9184#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9185#L61-3 assume true; 9807#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9804#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9805#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9796#L65-2 assume !(1 == mp_add_~i~0 % 256); 9797#L66-1 assume !(2 == mp_add_~i~0 % 256); 9785#L67-1 assume !(3 == mp_add_~i~0 % 256); 9786#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9974#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9973#L71-2 assume !(1 == mp_add_~i~0 % 256); 9972#L72-1 assume !(2 == mp_add_~i~0 % 256); 9971#L73-1 assume !(3 == mp_add_~i~0 % 256); 9970#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9969#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9968#L80-1 assume !(1 == mp_add_~i~0 % 256); 9966#L81-1 assume !(2 == mp_add_~i~0 % 256); 9964#L82-1 assume !(3 == mp_add_~i~0 % 256); 9963#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9962#L61-3 assume true; 9961#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9960#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9928#L65 [2018-11-18 17:31:29,017 INFO L796 eck$LassoCheckResult]: Loop: 9928#L65 assume !(0 == mp_add_~i~0 % 256); 9956#L65-2 assume !(1 == mp_add_~i~0 % 256); 9950#L66-1 assume !(2 == mp_add_~i~0 % 256); 9947#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 9887#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9882#L71 assume !(0 == mp_add_~i~0 % 256); 9918#L71-2 assume !(1 == mp_add_~i~0 % 256); 9893#L72-1 assume !(2 == mp_add_~i~0 % 256); 9880#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 9847#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9817#L76-1 assume !(0 == mp_add_~i~0 % 256); 9780#L80-1 assume !(1 == mp_add_~i~0 % 256); 9781#L81-1 assume !(2 == mp_add_~i~0 % 256); 9813#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9774#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9775#L61-3 assume true; 9770#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9771#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9802#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9897#L65-2 assume !(1 == mp_add_~i~0 % 256); 9943#L66-1 assume !(2 == mp_add_~i~0 % 256); 9942#L67-1 assume !(3 == mp_add_~i~0 % 256); 9941#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9940#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9939#L71-2 assume !(1 == mp_add_~i~0 % 256); 9938#L72-1 assume !(2 == mp_add_~i~0 % 256); 9937#L73-1 assume !(3 == mp_add_~i~0 % 256); 9936#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9935#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9934#L80-1 assume !(1 == mp_add_~i~0 % 256); 9933#L81-1 assume !(2 == mp_add_~i~0 % 256); 9932#L82-1 assume !(3 == mp_add_~i~0 % 256); 9931#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9930#L61-3 assume true; 9929#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9927#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9928#L65 [2018-11-18 17:31:29,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 5 times [2018-11-18 17:31:29,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:29,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 609090137, now seen corresponding path program 1 times [2018-11-18 17:31:29,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:29,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:29,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:31:29,076 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:31:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:31:29,076 INFO L87 Difference]: Start difference. First operand 1010 states and 1272 transitions. cyclomatic complexity: 276 Second operand 5 states. [2018-11-18 17:31:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:29,242 INFO L93 Difference]: Finished difference Result 1667 states and 2091 transitions. [2018-11-18 17:31:29,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:31:29,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1667 states and 2091 transitions. [2018-11-18 17:31:29,249 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1509 [2018-11-18 17:31:29,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1667 states to 1650 states and 2069 transitions. [2018-11-18 17:31:29,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1650 [2018-11-18 17:31:29,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1650 [2018-11-18 17:31:29,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1650 states and 2069 transitions. [2018-11-18 17:31:29,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:29,258 INFO L705 BuchiCegarLoop]: Abstraction has 1650 states and 2069 transitions. [2018-11-18 17:31:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states and 2069 transitions. [2018-11-18 17:31:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1020. [2018-11-18 17:31:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-11-18 17:31:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1284 transitions. [2018-11-18 17:31:29,275 INFO L728 BuchiCegarLoop]: Abstraction has 1020 states and 1284 transitions. [2018-11-18 17:31:29,275 INFO L608 BuchiCegarLoop]: Abstraction has 1020 states and 1284 transitions. [2018-11-18 17:31:29,275 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 17:31:29,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1020 states and 1284 transitions. [2018-11-18 17:31:29,278 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 920 [2018-11-18 17:31:29,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:29,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:29,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,279 INFO L794 eck$LassoCheckResult]: Stem: 11882#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 11848#L40 assume !(0 == mp_add_~a3~0 % 256); 11845#L40-1 mp_add_~nb~0 := 4; 11846#L50 assume !(0 == mp_add_~b3~0 % 256); 11875#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11961#L61-3 assume true; 11960#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11959#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11958#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11957#L65-2 assume !(1 == mp_add_~i~0 % 256); 11956#L66-1 assume !(2 == mp_add_~i~0 % 256); 11955#L67-1 assume !(3 == mp_add_~i~0 % 256); 11954#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11953#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11952#L71-2 assume !(1 == mp_add_~i~0 % 256); 11951#L72-1 assume !(2 == mp_add_~i~0 % 256); 11950#L73-1 assume !(3 == mp_add_~i~0 % 256); 11949#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11948#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11947#L80-1 assume !(1 == mp_add_~i~0 % 256); 11946#L81-1 assume !(2 == mp_add_~i~0 % 256); 11945#L82-1 assume !(3 == mp_add_~i~0 % 256); 11944#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11943#L61-3 assume true; 11942#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11940#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11941#L65 [2018-11-18 17:31:29,279 INFO L796 eck$LassoCheckResult]: Loop: 11941#L65 assume !(0 == mp_add_~i~0 % 256); 11934#L65-2 assume !(1 == mp_add_~i~0 % 256); 11935#L66-1 assume !(2 == mp_add_~i~0 % 256); 12029#L67-1 assume !(3 == mp_add_~i~0 % 256); 12028#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11996#L71 assume !(0 == mp_add_~i~0 % 256); 12015#L71-2 assume !(1 == mp_add_~i~0 % 256); 11997#L72-1 assume !(2 == mp_add_~i~0 % 256); 11993#L73-1 assume !(3 == mp_add_~i~0 % 256); 11992#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11991#L76-1 assume !(0 == mp_add_~i~0 % 256); 11990#L80-1 assume !(1 == mp_add_~i~0 % 256); 11989#L81-1 assume !(2 == mp_add_~i~0 % 256); 11987#L82-1 assume !(3 == mp_add_~i~0 % 256); 11985#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11984#L61-3 assume true; 11983#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11981#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11980#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11979#L65-2 assume !(1 == mp_add_~i~0 % 256); 11978#L66-1 assume !(2 == mp_add_~i~0 % 256); 11977#L67-1 assume !(3 == mp_add_~i~0 % 256); 11976#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11975#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11974#L71-2 assume !(1 == mp_add_~i~0 % 256); 11973#L72-1 assume !(2 == mp_add_~i~0 % 256); 11972#L73-1 assume !(3 == mp_add_~i~0 % 256); 11971#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11970#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11969#L80-1 assume !(1 == mp_add_~i~0 % 256); 11968#L81-1 assume !(2 == mp_add_~i~0 % 256); 11967#L82-1 assume !(3 == mp_add_~i~0 % 256); 11966#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11965#L61-3 assume true; 11963#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11964#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11941#L65 [2018-11-18 17:31:29,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 6 times [2018-11-18 17:31:29,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1778207845, now seen corresponding path program 1 times [2018-11-18 17:31:29,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:29,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:29,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:29,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:31:29,338 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:31:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:31:29,338 INFO L87 Difference]: Start difference. First operand 1020 states and 1284 transitions. cyclomatic complexity: 277 Second operand 4 states. [2018-11-18 17:31:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:29,442 INFO L93 Difference]: Finished difference Result 1650 states and 2087 transitions. [2018-11-18 17:31:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:31:29,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1650 states and 2087 transitions. [2018-11-18 17:31:29,447 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1533 [2018-11-18 17:31:29,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1650 states to 1649 states and 2086 transitions. [2018-11-18 17:31:29,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1649 [2018-11-18 17:31:29,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1649 [2018-11-18 17:31:29,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1649 states and 2086 transitions. [2018-11-18 17:31:29,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:29,456 INFO L705 BuchiCegarLoop]: Abstraction has 1649 states and 2086 transitions. [2018-11-18 17:31:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states and 2086 transitions. [2018-11-18 17:31:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1029. [2018-11-18 17:31:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-11-18 17:31:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1305 transitions. [2018-11-18 17:31:29,472 INFO L728 BuchiCegarLoop]: Abstraction has 1029 states and 1305 transitions. [2018-11-18 17:31:29,472 INFO L608 BuchiCegarLoop]: Abstraction has 1029 states and 1305 transitions. [2018-11-18 17:31:29,472 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 17:31:29,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1029 states and 1305 transitions. [2018-11-18 17:31:29,475 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 929 [2018-11-18 17:31:29,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:29,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:29,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:29,476 INFO L794 eck$LassoCheckResult]: Stem: 14560#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14532#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14529#L40 assume !(0 == mp_add_~a3~0 % 256); 14525#L40-1 mp_add_~nb~0 := 4; 14526#L50 assume !(0 == mp_add_~b3~0 % 256); 14554#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14640#L61-3 assume true; 14639#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14638#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14637#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14636#L65-2 assume !(1 == mp_add_~i~0 % 256); 14635#L66-1 assume !(2 == mp_add_~i~0 % 256); 14634#L67-1 assume !(3 == mp_add_~i~0 % 256); 14633#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14632#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 14631#L71-2 assume !(1 == mp_add_~i~0 % 256); 14630#L72-1 assume !(2 == mp_add_~i~0 % 256); 14629#L73-1 assume !(3 == mp_add_~i~0 % 256); 14628#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14627#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 14626#L80-1 assume !(1 == mp_add_~i~0 % 256); 14625#L81-1 assume !(2 == mp_add_~i~0 % 256); 14624#L82-1 assume !(3 == mp_add_~i~0 % 256); 14623#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14622#L61-3 assume true; 14621#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14620#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14618#L65 [2018-11-18 17:31:29,476 INFO L796 eck$LassoCheckResult]: Loop: 14618#L65 assume !(0 == mp_add_~i~0 % 256); 14613#L65-2 assume !(1 == mp_add_~i~0 % 256); 14614#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 14728#L67-1 assume !(3 == mp_add_~i~0 % 256); 14744#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14729#L71 assume !(0 == mp_add_~i~0 % 256); 14723#L71-2 assume !(1 == mp_add_~i~0 % 256); 14718#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 14715#L73-1 assume !(3 == mp_add_~i~0 % 256); 14712#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14709#L76-1 assume !(0 == mp_add_~i~0 % 256); 14706#L80-1 assume !(1 == mp_add_~i~0 % 256); 14703#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 14699#L82-1 assume !(3 == mp_add_~i~0 % 256); 14667#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14665#L61-3 assume true; 14641#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14642#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14672#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 14671#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14670#L76-1 assume !(0 == mp_add_~i~0 % 256); 14669#L80-1 assume !(1 == mp_add_~i~0 % 256); 14668#L81-1 assume !(2 == mp_add_~i~0 % 256); 14666#L82-1 assume !(3 == mp_add_~i~0 % 256); 14664#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14663#L61-3 assume true; 14662#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14660#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14659#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14658#L65-2 assume !(1 == mp_add_~i~0 % 256); 14657#L66-1 assume !(2 == mp_add_~i~0 % 256); 14656#L67-1 assume !(3 == mp_add_~i~0 % 256); 14655#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14654#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 14653#L71-2 assume !(1 == mp_add_~i~0 % 256); 14652#L72-1 assume !(2 == mp_add_~i~0 % 256); 14651#L73-1 assume !(3 == mp_add_~i~0 % 256); 14650#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14649#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 14648#L80-1 assume !(1 == mp_add_~i~0 % 256); 14647#L81-1 assume !(2 == mp_add_~i~0 % 256); 14646#L82-1 assume !(3 == mp_add_~i~0 % 256); 14645#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14644#L61-3 assume true; 14643#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14617#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14618#L65 [2018-11-18 17:31:29,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 7 times [2018-11-18 17:31:29,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:29,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash 680321065, now seen corresponding path program 1 times [2018-11-18 17:31:29,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:29,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:29,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 17:31:29,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:29,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:29,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:29,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 17:31:29,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:29,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-11-18 17:31:29,789 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:31:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:31:29,789 INFO L87 Difference]: Start difference. First operand 1029 states and 1305 transitions. cyclomatic complexity: 289 Second operand 11 states. [2018-11-18 17:31:30,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:30,155 INFO L93 Difference]: Finished difference Result 1860 states and 2288 transitions. [2018-11-18 17:31:30,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 17:31:30,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1860 states and 2288 transitions. [2018-11-18 17:31:30,161 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1675 [2018-11-18 17:31:30,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1860 states to 1807 states and 2226 transitions. [2018-11-18 17:31:30,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1807 [2018-11-18 17:31:30,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1807 [2018-11-18 17:31:30,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1807 states and 2226 transitions. [2018-11-18 17:31:30,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:30,170 INFO L705 BuchiCegarLoop]: Abstraction has 1807 states and 2226 transitions. [2018-11-18 17:31:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states and 2226 transitions. [2018-11-18 17:31:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1223. [2018-11-18 17:31:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2018-11-18 17:31:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1557 transitions. [2018-11-18 17:31:30,189 INFO L728 BuchiCegarLoop]: Abstraction has 1223 states and 1557 transitions. [2018-11-18 17:31:30,189 INFO L608 BuchiCegarLoop]: Abstraction has 1223 states and 1557 transitions. [2018-11-18 17:31:30,189 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 17:31:30,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1223 states and 1557 transitions. [2018-11-18 17:31:30,192 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1119 [2018-11-18 17:31:30,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:30,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:30,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:30,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:30,193 INFO L794 eck$LassoCheckResult]: Stem: 17606#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17580#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 17577#L40 assume !(0 == mp_add_~a3~0 % 256); 17573#L40-1 mp_add_~nb~0 := 4; 17574#L50 assume !(0 == mp_add_~b3~0 % 256); 17597#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17598#L61-3 assume true; 18349#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18334#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18331#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18329#L65-2 assume !(1 == mp_add_~i~0 % 256); 18330#L66-1 assume !(2 == mp_add_~i~0 % 256); 18296#L67-1 assume !(3 == mp_add_~i~0 % 256); 18297#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18507#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18257#L71-2 assume !(1 == mp_add_~i~0 % 256); 18258#L72-1 assume !(2 == mp_add_~i~0 % 256); 18506#L73-1 assume !(3 == mp_add_~i~0 % 256); 18253#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18251#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18252#L80-1 assume !(1 == mp_add_~i~0 % 256); 18489#L81-1 assume !(2 == mp_add_~i~0 % 256); 18486#L82-1 assume !(3 == mp_add_~i~0 % 256); 18483#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18480#L61-3 assume true; 18477#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18475#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18473#L65 [2018-11-18 17:31:30,193 INFO L796 eck$LassoCheckResult]: Loop: 18473#L65 assume !(0 == mp_add_~i~0 % 256); 18471#L65-2 assume !(1 == mp_add_~i~0 % 256); 18472#L66-1 assume !(2 == mp_add_~i~0 % 256); 18724#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 18390#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18692#L71 assume !(0 == mp_add_~i~0 % 256); 18734#L71-2 assume !(1 == mp_add_~i~0 % 256); 18733#L72-1 assume !(2 == mp_add_~i~0 % 256); 18690#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 18385#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18689#L76-1 assume !(0 == mp_add_~i~0 % 256); 18642#L80-1 assume !(1 == mp_add_~i~0 % 256); 18540#L81-1 assume !(2 == mp_add_~i~0 % 256); 18378#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 18285#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18294#L61-3 assume true; 18293#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18291#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18289#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18277#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18288#L76-1 assume !(0 == mp_add_~i~0 % 256); 18287#L80-1 assume !(1 == mp_add_~i~0 % 256); 18286#L81-1 assume !(2 == mp_add_~i~0 % 256); 18284#L82-1 assume !(3 == mp_add_~i~0 % 256); 18283#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18282#L61-3 assume true; 18280#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18281#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18332#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18395#L65-2 assume !(1 == mp_add_~i~0 % 256); 18505#L66-1 assume !(2 == mp_add_~i~0 % 256); 18504#L67-1 assume !(3 == mp_add_~i~0 % 256); 18502#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18501#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18500#L71-2 assume !(1 == mp_add_~i~0 % 256); 18498#L72-1 assume !(2 == mp_add_~i~0 % 256); 18496#L73-1 assume !(3 == mp_add_~i~0 % 256); 18494#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18492#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18490#L80-1 assume !(1 == mp_add_~i~0 % 256); 18487#L81-1 assume !(2 == mp_add_~i~0 % 256); 18484#L82-1 assume !(3 == mp_add_~i~0 % 256); 18481#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18478#L61-3 assume true; 18469#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18470#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18473#L65 [2018-11-18 17:31:30,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 8 times [2018-11-18 17:31:30,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:30,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash 835689189, now seen corresponding path program 1 times [2018-11-18 17:31:30,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:31:30,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:31:30,269 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:31:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:31:30,269 INFO L87 Difference]: Start difference. First operand 1223 states and 1557 transitions. cyclomatic complexity: 347 Second operand 4 states. [2018-11-18 17:31:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:30,331 INFO L93 Difference]: Finished difference Result 2502 states and 3093 transitions. [2018-11-18 17:31:30,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:31:30,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2502 states and 3093 transitions. [2018-11-18 17:31:30,340 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2361 [2018-11-18 17:31:30,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2502 states to 2502 states and 3093 transitions. [2018-11-18 17:31:30,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2502 [2018-11-18 17:31:30,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2502 [2018-11-18 17:31:30,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2502 states and 3093 transitions. [2018-11-18 17:31:30,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:30,351 INFO L705 BuchiCegarLoop]: Abstraction has 2502 states and 3093 transitions. [2018-11-18 17:31:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states and 3093 transitions. [2018-11-18 17:31:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1958. [2018-11-18 17:31:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1958 states. [2018-11-18 17:31:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2445 transitions. [2018-11-18 17:31:30,379 INFO L728 BuchiCegarLoop]: Abstraction has 1958 states and 2445 transitions. [2018-11-18 17:31:30,379 INFO L608 BuchiCegarLoop]: Abstraction has 1958 states and 2445 transitions. [2018-11-18 17:31:30,379 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 17:31:30,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1958 states and 2445 transitions. [2018-11-18 17:31:30,383 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1854 [2018-11-18 17:31:30,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:30,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:30,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:30,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:30,384 INFO L794 eck$LassoCheckResult]: Stem: 21341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21310#L40 assume !(0 == mp_add_~a3~0 % 256); 21306#L40-1 mp_add_~nb~0 := 4; 21307#L50 assume !(0 == mp_add_~b3~0 % 256); 21333#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 21334#L61-3 assume true; 23022#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23017#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22991#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 21311#L65-2 assume !(1 == mp_add_~i~0 % 256); 21312#L66-1 assume !(2 == mp_add_~i~0 % 256); 21323#L67-1 assume !(3 == mp_add_~i~0 % 256); 21324#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23194#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23193#L71-2 assume !(1 == mp_add_~i~0 % 256); 23192#L72-1 assume !(2 == mp_add_~i~0 % 256); 23191#L73-1 assume !(3 == mp_add_~i~0 % 256); 23190#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23182#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23179#L80-1 assume !(1 == mp_add_~i~0 % 256); 23176#L81-1 assume !(2 == mp_add_~i~0 % 256); 23173#L82-1 assume !(3 == mp_add_~i~0 % 256); 23170#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23142#L61-3 assume true; 23143#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23116#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23117#L65 [2018-11-18 17:31:30,384 INFO L796 eck$LassoCheckResult]: Loop: 23117#L65 assume !(0 == mp_add_~i~0 % 256); 23118#L65-2 assume !(1 == mp_add_~i~0 % 256); 22986#L66-1 assume !(2 == mp_add_~i~0 % 256); 22988#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 23082#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23074#L71 assume !(0 == mp_add_~i~0 % 256); 23114#L71-2 assume !(1 == mp_add_~i~0 % 256); 23113#L72-1 assume !(2 == mp_add_~i~0 % 256); 22393#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 23071#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23064#L76-1 assume !(0 == mp_add_~i~0 % 256); 23053#L80-1 assume !(1 == mp_add_~i~0 % 256); 23048#L81-1 assume !(2 == mp_add_~i~0 % 256); 23046#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 23042#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23043#L61-3 assume true; 23040#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23037#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 23039#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23031#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 23030#L76-1 assume !(0 == mp_add_~i~0 % 256); 23029#L80-1 assume !(1 == mp_add_~i~0 % 256); 23028#L81-1 assume !(2 == mp_add_~i~0 % 256); 23026#L82-1 assume !(3 == mp_add_~i~0 % 256); 23024#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23025#L61-3 assume true; 23018#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23019#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23055#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 23087#L65-2 assume !(1 == mp_add_~i~0 % 256); 21343#L66-1 assume !(2 == mp_add_~i~0 % 256); 21344#L67-1 assume !(3 == mp_add_~i~0 % 256); 23189#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23188#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23187#L71-2 assume !(1 == mp_add_~i~0 % 256); 23186#L72-1 assume !(2 == mp_add_~i~0 % 256); 23185#L73-1 assume !(3 == mp_add_~i~0 % 256); 23184#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 23181#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23178#L80-1 assume !(1 == mp_add_~i~0 % 256); 23175#L81-1 assume !(2 == mp_add_~i~0 % 256); 23172#L82-1 assume !(3 == mp_add_~i~0 % 256); 23163#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23164#L61-3 assume true; 23136#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23117#L65 [2018-11-18 17:31:30,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 9 times [2018-11-18 17:31:30,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:30,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1495220711, now seen corresponding path program 1 times [2018-11-18 17:31:30,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:30,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:30,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:30,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:30,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:30,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:30,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:30,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-18 17:31:30,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:31:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:31:30,583 INFO L87 Difference]: Start difference. First operand 1958 states and 2445 transitions. cyclomatic complexity: 500 Second operand 8 states. [2018-11-18 17:31:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:31,147 INFO L93 Difference]: Finished difference Result 4711 states and 5703 transitions. [2018-11-18 17:31:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 17:31:31,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4711 states and 5703 transitions. [2018-11-18 17:31:31,155 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 4542 [2018-11-18 17:31:31,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4711 states to 4637 states and 5488 transitions. [2018-11-18 17:31:31,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4637 [2018-11-18 17:31:31,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4637 [2018-11-18 17:31:31,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4637 states and 5488 transitions. [2018-11-18 17:31:31,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:31,170 INFO L705 BuchiCegarLoop]: Abstraction has 4637 states and 5488 transitions. [2018-11-18 17:31:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4637 states and 5488 transitions. [2018-11-18 17:31:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4637 to 2876. [2018-11-18 17:31:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-11-18 17:31:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3433 transitions. [2018-11-18 17:31:31,217 INFO L728 BuchiCegarLoop]: Abstraction has 2876 states and 3433 transitions. [2018-11-18 17:31:31,218 INFO L608 BuchiCegarLoop]: Abstraction has 2876 states and 3433 transitions. [2018-11-18 17:31:31,218 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 17:31:31,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2876 states and 3433 transitions. [2018-11-18 17:31:31,224 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2781 [2018-11-18 17:31:31,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:31,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:31,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,225 INFO L794 eck$LassoCheckResult]: Stem: 28162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 28138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 28135#L40 assume !(0 == mp_add_~a3~0 % 256); 28131#L40-1 mp_add_~nb~0 := 4; 28132#L50 assume !(0 == mp_add_~b3~0 % 256); 28156#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 28832#L61-3 assume true; 28831#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28830#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28829#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28828#L65-2 assume !(1 == mp_add_~i~0 % 256); 28827#L66-1 assume !(2 == mp_add_~i~0 % 256); 28826#L67-1 assume !(3 == mp_add_~i~0 % 256); 28825#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28824#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28823#L71-2 assume !(1 == mp_add_~i~0 % 256); 28822#L72-1 assume !(2 == mp_add_~i~0 % 256); 28821#L73-1 assume !(3 == mp_add_~i~0 % 256); 28820#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28819#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28818#L80-1 assume !(1 == mp_add_~i~0 % 256); 28817#L81-1 assume !(2 == mp_add_~i~0 % 256); 28816#L82-1 assume !(3 == mp_add_~i~0 % 256); 28815#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28814#L61-3 assume true; 28813#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28808#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28809#L65 [2018-11-18 17:31:31,225 INFO L796 eck$LassoCheckResult]: Loop: 28809#L65 assume !(0 == mp_add_~i~0 % 256); 28887#L65-2 assume !(1 == mp_add_~i~0 % 256); 28798#L66-1 assume !(2 == mp_add_~i~0 % 256); 28799#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 28604#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28743#L71 assume !(0 == mp_add_~i~0 % 256); 28763#L71-2 assume !(1 == mp_add_~i~0 % 256); 28760#L72-1 assume !(2 == mp_add_~i~0 % 256); 28751#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 28589#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28738#L76-1 assume !(0 == mp_add_~i~0 % 256); 28735#L80-1 assume !(1 == mp_add_~i~0 % 256); 28732#L81-1 assume !(2 == mp_add_~i~0 % 256); 28713#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 28671#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28703#L61-3 assume true; 28701#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28698#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28690#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28685#L76-1 assume !(0 == mp_add_~i~0 % 256); 28684#L80-1 assume !(1 == mp_add_~i~0 % 256); 28683#L81-1 assume !(2 == mp_add_~i~0 % 256); 28682#L82-1 assume !(3 == mp_add_~i~0 % 256); 28681#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28680#L61-3 assume true; 28679#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28675#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28649#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28642#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28643#L76-1 assume !(0 == mp_add_~i~0 % 256); 28775#L80-1 assume !(1 == mp_add_~i~0 % 256); 28774#L81-1 assume !(2 == mp_add_~i~0 % 256); 28773#L82-1 assume !(3 == mp_add_~i~0 % 256); 28740#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28737#L61-3 assume true; 28734#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28719#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28623#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28621#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28620#L76-1 assume !(0 == mp_add_~i~0 % 256); 28619#L80-1 assume !(1 == mp_add_~i~0 % 256); 28618#L81-1 assume !(2 == mp_add_~i~0 % 256); 28616#L82-1 assume !(3 == mp_add_~i~0 % 256); 28615#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28614#L61-3 assume true; 28613#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28612#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28608#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28609#L65-2 assume !(1 == mp_add_~i~0 % 256); 28862#L66-1 assume !(2 == mp_add_~i~0 % 256); 28861#L67-1 assume !(3 == mp_add_~i~0 % 256); 28860#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28859#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28858#L71-2 assume !(1 == mp_add_~i~0 % 256); 28857#L72-1 assume !(2 == mp_add_~i~0 % 256); 28856#L73-1 assume !(3 == mp_add_~i~0 % 256); 28855#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28854#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28853#L80-1 assume !(1 == mp_add_~i~0 % 256); 28852#L81-1 assume !(2 == mp_add_~i~0 % 256); 28851#L82-1 assume !(3 == mp_add_~i~0 % 256); 28850#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28849#L61-3 assume true; 28848#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28847#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28809#L65 [2018-11-18 17:31:31,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 10 times [2018-11-18 17:31:31,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:31,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:31,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1937158911, now seen corresponding path program 2 times [2018-11-18 17:31:31,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 17:31:31,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:31,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:31:31,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:31:31,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:31:31,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 17:31:31,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:31,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 17:31:31,383 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:31:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:31:31,383 INFO L87 Difference]: Start difference. First operand 2876 states and 3433 transitions. cyclomatic complexity: 569 Second operand 7 states. [2018-11-18 17:31:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:31,537 INFO L93 Difference]: Finished difference Result 1449 states and 1603 transitions. [2018-11-18 17:31:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:31:31,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1449 states and 1603 transitions. [2018-11-18 17:31:31,539 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1249 [2018-11-18 17:31:31,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1449 states to 1394 states and 1542 transitions. [2018-11-18 17:31:31,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1394 [2018-11-18 17:31:31,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1394 [2018-11-18 17:31:31,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1394 states and 1542 transitions. [2018-11-18 17:31:31,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:31,542 INFO L705 BuchiCegarLoop]: Abstraction has 1394 states and 1542 transitions. [2018-11-18 17:31:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states and 1542 transitions. [2018-11-18 17:31:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 835. [2018-11-18 17:31:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-11-18 17:31:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 941 transitions. [2018-11-18 17:31:31,552 INFO L728 BuchiCegarLoop]: Abstraction has 835 states and 941 transitions. [2018-11-18 17:31:31,552 INFO L608 BuchiCegarLoop]: Abstraction has 835 states and 941 transitions. [2018-11-18 17:31:31,552 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 17:31:31,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 835 states and 941 transitions. [2018-11-18 17:31:31,554 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 731 [2018-11-18 17:31:31,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:31,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:31,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,555 INFO L794 eck$LassoCheckResult]: Stem: 32701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 32676#L40 assume !(0 == mp_add_~a3~0 % 256); 32673#L40-1 mp_add_~nb~0 := 4; 32674#L50 assume !(0 == mp_add_~b3~0 % 256); 32696#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32931#L61-3 assume true; 32930#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32929#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32928#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32927#L65-2 assume !(1 == mp_add_~i~0 % 256); 32926#L66-1 assume !(2 == mp_add_~i~0 % 256); 32925#L67-1 assume !(3 == mp_add_~i~0 % 256); 32924#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32923#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32922#L71-2 assume !(1 == mp_add_~i~0 % 256); 32921#L72-1 assume !(2 == mp_add_~i~0 % 256); 32920#L73-1 assume !(3 == mp_add_~i~0 % 256); 32919#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32918#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32917#L80-1 assume !(1 == mp_add_~i~0 % 256); 32916#L81-1 assume !(2 == mp_add_~i~0 % 256); 32915#L82-1 assume !(3 == mp_add_~i~0 % 256); 32913#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32911#L61-3 assume true; 32898#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32897#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32896#L65 assume !(0 == mp_add_~i~0 % 256); 32865#L65-2 assume !(1 == mp_add_~i~0 % 256); 32866#L66-1 [2018-11-18 17:31:31,555 INFO L796 eck$LassoCheckResult]: Loop: 32866#L66-1 assume !(2 == mp_add_~i~0 % 256); 32962#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 32881#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32961#L71 assume !(0 == mp_add_~i~0 % 256); 32960#L71-2 assume !(1 == mp_add_~i~0 % 256); 32958#L72-1 assume !(2 == mp_add_~i~0 % 256); 32709#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 32876#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32955#L76-1 assume !(0 == mp_add_~i~0 % 256); 32954#L80-1 assume !(1 == mp_add_~i~0 % 256); 32953#L81-1 assume !(2 == mp_add_~i~0 % 256); 32952#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32951#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32950#L61-3 assume true; 32949#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32948#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32938#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32936#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32935#L76-1 assume !(0 == mp_add_~i~0 % 256); 32934#L80-1 assume !(1 == mp_add_~i~0 % 256); 32933#L81-1 assume !(2 == mp_add_~i~0 % 256); 32932#L82-1 assume !(3 == mp_add_~i~0 % 256); 32914#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32912#L61-3 assume true; 32910#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32909#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32907#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32901#L71 assume !(0 == mp_add_~i~0 % 256); 32904#L71-2 assume !(1 == mp_add_~i~0 % 256); 32902#L72-1 assume !(2 == mp_add_~i~0 % 256); 32899#L73-1 assume !(3 == mp_add_~i~0 % 256); 32874#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32872#L76-1 assume !(0 == mp_add_~i~0 % 256); 32840#L80-1 assume !(1 == mp_add_~i~0 % 256); 32841#L81-1 assume !(2 == mp_add_~i~0 % 256); 32895#L82-1 assume !(3 == mp_add_~i~0 % 256); 32894#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32893#L61-3 assume true; 32892#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32891#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32889#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32886#L71 assume !(0 == mp_add_~i~0 % 256); 32883#L71-2 assume !(1 == mp_add_~i~0 % 256); 32855#L72-1 assume !(2 == mp_add_~i~0 % 256); 32875#L73-1 assume !(3 == mp_add_~i~0 % 256); 32873#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32844#L76-1 assume !(0 == mp_add_~i~0 % 256); 32845#L80-1 assume !(1 == mp_add_~i~0 % 256); 32871#L81-1 assume !(2 == mp_add_~i~0 % 256); 32869#L82-1 assume !(3 == mp_add_~i~0 % 256); 32868#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32867#L61-3 assume true; 32864#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32861#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32862#L65 assume !(0 == mp_add_~i~0 % 256); 32888#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 32863#L66-1 assume !(2 == mp_add_~i~0 % 256); 32860#L67-1 assume !(3 == mp_add_~i~0 % 256); 32858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32856#L71 assume !(0 == mp_add_~i~0 % 256); 32852#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 32853#L72-1 assume !(2 == mp_add_~i~0 % 256); 32848#L73-1 assume !(3 == mp_add_~i~0 % 256); 32849#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32842#L76-1 assume !(0 == mp_add_~i~0 % 256); 32843#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32836#L81-1 assume !(2 == mp_add_~i~0 % 256); 32837#L82-1 assume !(3 == mp_add_~i~0 % 256); 32832#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32833#L61-3 assume true; 32828#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32829#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32967#L65 assume !(0 == mp_add_~i~0 % 256); 32965#L65-2 assume !(1 == mp_add_~i~0 % 256); 32866#L66-1 [2018-11-18 17:31:31,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,555 INFO L82 PathProgramCache]: Analyzing trace with hash -212911490, now seen corresponding path program 1 times [2018-11-18 17:31:31,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:31,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:31,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:31,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:31,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:31:31,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:31,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-18 17:31:31,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:31:31,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1767477029, now seen corresponding path program 1 times [2018-11-18 17:31:31,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 17:31:31,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:31:31,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:31:31,820 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:31,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:31:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:31:31,821 INFO L87 Difference]: Start difference. First operand 835 states and 941 transitions. cyclomatic complexity: 111 Second operand 7 states. [2018-11-18 17:31:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:31,902 INFO L93 Difference]: Finished difference Result 897 states and 1003 transitions. [2018-11-18 17:31:31,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:31:31,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 897 states and 1003 transitions. [2018-11-18 17:31:31,904 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 731 [2018-11-18 17:31:31,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 897 states to 897 states and 1003 transitions. [2018-11-18 17:31:31,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 897 [2018-11-18 17:31:31,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 897 [2018-11-18 17:31:31,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 897 states and 1003 transitions. [2018-11-18 17:31:31,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:31,907 INFO L705 BuchiCegarLoop]: Abstraction has 897 states and 1003 transitions. [2018-11-18 17:31:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states and 1003 transitions. [2018-11-18 17:31:31,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 834. [2018-11-18 17:31:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-11-18 17:31:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 936 transitions. [2018-11-18 17:31:31,915 INFO L728 BuchiCegarLoop]: Abstraction has 834 states and 936 transitions. [2018-11-18 17:31:31,915 INFO L608 BuchiCegarLoop]: Abstraction has 834 states and 936 transitions. [2018-11-18 17:31:31,915 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 17:31:31,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 834 states and 936 transitions. [2018-11-18 17:31:31,917 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 731 [2018-11-18 17:31:31,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:31,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:31,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:31,918 INFO L794 eck$LassoCheckResult]: Stem: 34534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 34507#L40 assume !(0 == mp_add_~a3~0 % 256); 34503#L40-1 mp_add_~nb~0 := 4; 34504#L50 assume !(0 == mp_add_~b3~0 % 256); 34530#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34825#L61-3 assume true; 34822#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34819#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34815#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34810#L65-2 assume !(1 == mp_add_~i~0 % 256); 34806#L66-1 assume !(2 == mp_add_~i~0 % 256); 34804#L67-1 assume !(3 == mp_add_~i~0 % 256); 34802#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34800#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34798#L71-2 assume !(1 == mp_add_~i~0 % 256); 34796#L72-1 assume !(2 == mp_add_~i~0 % 256); 34794#L73-1 assume !(3 == mp_add_~i~0 % 256); 34792#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34790#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34788#L80-1 assume !(1 == mp_add_~i~0 % 256); 34785#L81-1 assume !(2 == mp_add_~i~0 % 256); 34783#L82-1 assume !(3 == mp_add_~i~0 % 256); 34780#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34777#L61-3 assume true; 34773#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34771#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34769#L65 assume !(0 == mp_add_~i~0 % 256); 34766#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34765#L66-1 [2018-11-18 17:31:31,918 INFO L796 eck$LassoCheckResult]: Loop: 34765#L66-1 assume !(2 == mp_add_~i~0 % 256); 34764#L67-1 assume !(3 == mp_add_~i~0 % 256); 34762#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34753#L71 assume !(0 == mp_add_~i~0 % 256); 34751#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 34749#L72-1 assume !(2 == mp_add_~i~0 % 256); 34746#L73-1 assume !(3 == mp_add_~i~0 % 256); 34743#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34741#L76-1 assume !(0 == mp_add_~i~0 % 256); 34738#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34734#L81-1 assume !(2 == mp_add_~i~0 % 256); 34696#L82-1 assume !(3 == mp_add_~i~0 % 256); 34690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34687#L61-3 assume true; 34684#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34680#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34565#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34676#L71 assume !(0 == mp_add_~i~0 % 256); 34673#L71-2 assume !(1 == mp_add_~i~0 % 256); 34671#L72-1 assume !(2 == mp_add_~i~0 % 256); 34669#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 34602#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34665#L76-1 assume !(0 == mp_add_~i~0 % 256); 34664#L80-1 assume !(1 == mp_add_~i~0 % 256); 34662#L81-1 assume !(2 == mp_add_~i~0 % 256); 34660#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 34658#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34656#L61-3 assume true; 34654#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34650#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34646#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34644#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34643#L76-1 assume !(0 == mp_add_~i~0 % 256); 34642#L80-1 assume !(1 == mp_add_~i~0 % 256); 34641#L81-1 assume !(2 == mp_add_~i~0 % 256); 34640#L82-1 assume !(3 == mp_add_~i~0 % 256); 34639#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34638#L61-3 assume true; 34637#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34636#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34634#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34628#L71 assume !(0 == mp_add_~i~0 % 256); 34631#L71-2 assume !(1 == mp_add_~i~0 % 256); 34629#L72-1 assume !(2 == mp_add_~i~0 % 256); 34626#L73-1 assume !(3 == mp_add_~i~0 % 256); 34625#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34624#L76-1 assume !(0 == mp_add_~i~0 % 256); 34623#L80-1 assume !(1 == mp_add_~i~0 % 256); 34622#L81-1 assume !(2 == mp_add_~i~0 % 256); 34621#L82-1 assume !(3 == mp_add_~i~0 % 256); 34620#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34619#L61-3 assume true; 34618#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34616#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34615#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34613#L71 assume !(0 == mp_add_~i~0 % 256); 34609#L71-2 assume !(1 == mp_add_~i~0 % 256); 34587#L72-1 assume !(2 == mp_add_~i~0 % 256); 34601#L73-1 assume !(3 == mp_add_~i~0 % 256); 34600#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34599#L76-1 assume !(0 == mp_add_~i~0 % 256); 34598#L80-1 assume !(1 == mp_add_~i~0 % 256); 34597#L81-1 assume !(2 == mp_add_~i~0 % 256); 34595#L82-1 assume !(3 == mp_add_~i~0 % 256); 34594#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34593#L61-3 assume true; 34592#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34590#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34591#L65 assume !(0 == mp_add_~i~0 % 256); 34763#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34765#L66-1 [2018-11-18 17:31:31,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,918 INFO L82 PathProgramCache]: Analyzing trace with hash -212911492, now seen corresponding path program 1 times [2018-11-18 17:31:31,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:31,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1785032043, now seen corresponding path program 1 times [2018-11-18 17:31:31,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:31,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 17:31:32,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:32,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:32,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:32,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-18 17:31:32,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-18 17:31:32,121 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:32,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:31:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:31:32,121 INFO L87 Difference]: Start difference. First operand 834 states and 936 transitions. cyclomatic complexity: 107 Second operand 8 states. [2018-11-18 17:31:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:32,250 INFO L93 Difference]: Finished difference Result 992 states and 1093 transitions. [2018-11-18 17:31:32,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:31:32,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1093 transitions. [2018-11-18 17:31:32,252 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 758 [2018-11-18 17:31:32,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 924 states and 1022 transitions. [2018-11-18 17:31:32,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 924 [2018-11-18 17:31:32,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 924 [2018-11-18 17:31:32,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 924 states and 1022 transitions. [2018-11-18 17:31:32,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:32,254 INFO L705 BuchiCegarLoop]: Abstraction has 924 states and 1022 transitions. [2018-11-18 17:31:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states and 1022 transitions. [2018-11-18 17:31:32,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 727. [2018-11-18 17:31:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-18 17:31:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 814 transitions. [2018-11-18 17:31:32,258 INFO L728 BuchiCegarLoop]: Abstraction has 727 states and 814 transitions. [2018-11-18 17:31:32,258 INFO L608 BuchiCegarLoop]: Abstraction has 727 states and 814 transitions. [2018-11-18 17:31:32,258 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 17:31:32,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 727 states and 814 transitions. [2018-11-18 17:31:32,260 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 624 [2018-11-18 17:31:32,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:32,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:32,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:32,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:32,260 INFO L794 eck$LassoCheckResult]: Stem: 36579#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36559#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 36556#L40 assume !(0 == mp_add_~a3~0 % 256); 36553#L40-1 mp_add_~nb~0 := 4; 36554#L50 assume !(0 == mp_add_~b3~0 % 256); 36576#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36901#L61-3 assume true; 36900#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36899#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36898#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36897#L65-2 assume !(1 == mp_add_~i~0 % 256); 36896#L66-1 assume !(2 == mp_add_~i~0 % 256); 36895#L67-1 assume !(3 == mp_add_~i~0 % 256); 36894#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36893#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36892#L71-2 assume !(1 == mp_add_~i~0 % 256); 36891#L72-1 assume !(2 == mp_add_~i~0 % 256); 36890#L73-1 assume !(3 == mp_add_~i~0 % 256); 36889#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36888#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36887#L80-1 assume !(1 == mp_add_~i~0 % 256); 36886#L81-1 assume !(2 == mp_add_~i~0 % 256); 36885#L82-1 assume !(3 == mp_add_~i~0 % 256); 36884#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36883#L61-3 assume true; 36882#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36881#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36880#L65 assume !(0 == mp_add_~i~0 % 256); 36879#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 36878#L66-1 [2018-11-18 17:31:32,261 INFO L796 eck$LassoCheckResult]: Loop: 36878#L66-1 assume !(2 == mp_add_~i~0 % 256); 36876#L67-1 assume !(3 == mp_add_~i~0 % 256); 36874#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36872#L71 assume !(0 == mp_add_~i~0 % 256); 36867#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 36865#L72-1 assume !(2 == mp_add_~i~0 % 256); 36863#L73-1 assume !(3 == mp_add_~i~0 % 256); 36861#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36859#L76-1 assume !(0 == mp_add_~i~0 % 256); 36856#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36840#L81-1 assume !(2 == mp_add_~i~0 % 256); 36837#L82-1 assume !(3 == mp_add_~i~0 % 256); 36832#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36831#L61-3 assume true; 36830#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36828#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36829#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36844#L71 assume !(0 == mp_add_~i~0 % 256); 36842#L71-2 assume !(1 == mp_add_~i~0 % 256); 36841#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 36838#L73-1 assume !(3 == mp_add_~i~0 % 256); 36834#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36833#L76-1 assume !(0 == mp_add_~i~0 % 256); 36822#L80-1 assume !(1 == mp_add_~i~0 % 256); 36819#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36815#L82-1 assume !(3 == mp_add_~i~0 % 256); 36811#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36810#L61-3 assume true; 36809#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36780#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36781#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 36743#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36741#L76-1 assume !(0 == mp_add_~i~0 % 256); 36740#L80-1 assume !(1 == mp_add_~i~0 % 256); 36739#L81-1 assume !(2 == mp_add_~i~0 % 256); 36738#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36722#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36737#L61-3 assume true; 36736#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36735#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36689#L65 assume !(0 == mp_add_~i~0 % 256); 36696#L65-2 assume !(1 == mp_add_~i~0 % 256); 36697#L66-1 assume !(2 == mp_add_~i~0 % 256); 36686#L67-1 assume !(3 == mp_add_~i~0 % 256); 36687#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 36678#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36679#L76-1 assume !(0 == mp_add_~i~0 % 256); 36674#L80-1 assume !(1 == mp_add_~i~0 % 256); 36675#L81-1 assume !(2 == mp_add_~i~0 % 256); 36670#L82-1 assume !(3 == mp_add_~i~0 % 256); 36671#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36666#L61-3 assume true; 36667#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36661#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36662#L65 assume !(0 == mp_add_~i~0 % 256); 36656#L65-2 assume !(1 == mp_add_~i~0 % 256); 36657#L66-1 assume !(2 == mp_add_~i~0 % 256); 36648#L67-1 assume !(3 == mp_add_~i~0 % 256); 36649#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 36640#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36641#L76-1 assume !(0 == mp_add_~i~0 % 256); 36636#L80-1 assume !(1 == mp_add_~i~0 % 256); 36637#L81-1 assume !(2 == mp_add_~i~0 % 256); 36632#L82-1 assume !(3 == mp_add_~i~0 % 256); 36633#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36628#L61-3 assume true; 36629#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36623#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36624#L65 assume !(0 == mp_add_~i~0 % 256); 36617#L65-2 assume !(1 == mp_add_~i~0 % 256); 36618#L66-1 assume !(2 == mp_add_~i~0 % 256); 36612#L67-1 assume !(3 == mp_add_~i~0 % 256); 36608#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 36607#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36727#L76-1 assume !(0 == mp_add_~i~0 % 256); 36724#L80-1 assume !(1 == mp_add_~i~0 % 256); 36723#L81-1 assume !(2 == mp_add_~i~0 % 256); 36721#L82-1 assume !(3 == mp_add_~i~0 % 256); 36596#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36597#L61-3 assume true; 36592#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36593#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36620#L65 assume !(0 == mp_add_~i~0 % 256); 36621#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 36878#L66-1 [2018-11-18 17:31:32,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash -212911492, now seen corresponding path program 2 times [2018-11-18 17:31:32,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:32,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:32,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:32,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:32,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:32,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1262228017, now seen corresponding path program 1 times [2018-11-18 17:31:32,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:32,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:32,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:32,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 138 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-18 17:31:32,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:32,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:32,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:32,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 130 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 17:31:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2018-11-18 17:31:32,507 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:31:32,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:31:32,507 INFO L87 Difference]: Start difference. First operand 727 states and 814 transitions. cyclomatic complexity: 92 Second operand 11 states. [2018-11-18 17:31:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:33,351 INFO L93 Difference]: Finished difference Result 1520 states and 1664 transitions. [2018-11-18 17:31:33,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-18 17:31:33,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1520 states and 1664 transitions. [2018-11-18 17:31:33,355 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1017 [2018-11-18 17:31:33,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1520 states to 1370 states and 1506 transitions. [2018-11-18 17:31:33,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1370 [2018-11-18 17:31:33,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1370 [2018-11-18 17:31:33,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1370 states and 1506 transitions. [2018-11-18 17:31:33,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:33,359 INFO L705 BuchiCegarLoop]: Abstraction has 1370 states and 1506 transitions. [2018-11-18 17:31:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states and 1506 transitions. [2018-11-18 17:31:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1025. [2018-11-18 17:31:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-18 17:31:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1149 transitions. [2018-11-18 17:31:33,368 INFO L728 BuchiCegarLoop]: Abstraction has 1025 states and 1149 transitions. [2018-11-18 17:31:33,368 INFO L608 BuchiCegarLoop]: Abstraction has 1025 states and 1149 transitions. [2018-11-18 17:31:33,368 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 17:31:33,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1025 states and 1149 transitions. [2018-11-18 17:31:33,370 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 914 [2018-11-18 17:31:33,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:33,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:33,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:33,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:33,371 INFO L794 eck$LassoCheckResult]: Stem: 39132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 39112#L40 assume !(0 == mp_add_~a3~0 % 256); 39108#L40-1 mp_add_~nb~0 := 4; 39109#L50 assume !(0 == mp_add_~b3~0 % 256); 39128#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 39574#L61-3 assume true; 39573#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39572#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39571#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 39570#L65-2 assume !(1 == mp_add_~i~0 % 256); 39569#L66-1 assume !(2 == mp_add_~i~0 % 256); 39568#L67-1 assume !(3 == mp_add_~i~0 % 256); 39567#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39566#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 39565#L71-2 assume !(1 == mp_add_~i~0 % 256); 39564#L72-1 assume !(2 == mp_add_~i~0 % 256); 39563#L73-1 assume !(3 == mp_add_~i~0 % 256); 39562#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39561#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 39560#L80-1 assume !(1 == mp_add_~i~0 % 256); 39559#L81-1 assume !(2 == mp_add_~i~0 % 256); 39558#L82-1 assume !(3 == mp_add_~i~0 % 256); 39557#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39556#L61-3 assume true; 39555#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39554#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39553#L65 assume !(0 == mp_add_~i~0 % 256); 39552#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 39551#L66-1 [2018-11-18 17:31:33,371 INFO L796 eck$LassoCheckResult]: Loop: 39551#L66-1 assume !(2 == mp_add_~i~0 % 256); 39550#L67-1 assume !(3 == mp_add_~i~0 % 256); 39549#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39548#L71 assume !(0 == mp_add_~i~0 % 256); 39547#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 39546#L72-1 assume !(2 == mp_add_~i~0 % 256); 39545#L73-1 assume !(3 == mp_add_~i~0 % 256); 39544#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 39543#L76-1 assume !(0 == mp_add_~i~0 % 256); 39542#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 39541#L81-1 assume !(2 == mp_add_~i~0 % 256); 39540#L82-1 assume !(3 == mp_add_~i~0 % 256); 39539#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39538#L61-3 assume true; 39537#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39536#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39535#L65 assume !(0 == mp_add_~i~0 % 256); 39534#L65-2 assume !(1 == mp_add_~i~0 % 256); 39533#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 39377#L67-1 assume !(3 == mp_add_~i~0 % 256); 39532#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39531#L71 assume !(0 == mp_add_~i~0 % 256); 39530#L71-2 assume !(1 == mp_add_~i~0 % 256); 39529#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 39528#L73-1 assume !(3 == mp_add_~i~0 % 256); 39526#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 39523#L76-1 assume !(0 == mp_add_~i~0 % 256); 39436#L80-1 assume !(1 == mp_add_~i~0 % 256); 39400#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 39398#L82-1 assume !(3 == mp_add_~i~0 % 256); 39395#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39391#L61-3 assume true; 39392#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39384#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39383#L65 assume !(0 == mp_add_~i~0 % 256); 39382#L65-2 assume !(1 == mp_add_~i~0 % 256); 39381#L66-1 assume !(2 == mp_add_~i~0 % 256); 39380#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 39373#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39378#L71 assume !(0 == mp_add_~i~0 % 256); 39374#L71-2 assume !(1 == mp_add_~i~0 % 256); 39370#L72-1 assume !(2 == mp_add_~i~0 % 256); 39366#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 39363#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39361#L76-1 assume !(0 == mp_add_~i~0 % 256); 39359#L80-1 assume !(1 == mp_add_~i~0 % 256); 39357#L81-1 assume !(2 == mp_add_~i~0 % 256); 39354#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 39353#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39352#L61-3 assume true; 39351#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39349#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39350#L65 assume !(0 == mp_add_~i~0 % 256); 39428#L65-2 assume !(1 == mp_add_~i~0 % 256); 39427#L66-1 assume !(2 == mp_add_~i~0 % 256); 39426#L67-1 assume !(3 == mp_add_~i~0 % 256); 39425#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 39424#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39423#L76-1 assume !(0 == mp_add_~i~0 % 256); 39422#L80-1 assume !(1 == mp_add_~i~0 % 256); 39421#L81-1 assume !(2 == mp_add_~i~0 % 256); 39420#L82-1 assume !(3 == mp_add_~i~0 % 256); 39419#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39418#L61-3 assume true; 39417#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39416#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39415#L65 assume !(0 == mp_add_~i~0 % 256); 39414#L65-2 assume !(1 == mp_add_~i~0 % 256); 39413#L66-1 assume !(2 == mp_add_~i~0 % 256); 39411#L67-1 assume !(3 == mp_add_~i~0 % 256); 39408#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 39406#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39405#L76-1 assume !(0 == mp_add_~i~0 % 256); 39404#L80-1 assume !(1 == mp_add_~i~0 % 256); 39403#L81-1 assume !(2 == mp_add_~i~0 % 256); 39401#L82-1 assume !(3 == mp_add_~i~0 % 256); 39402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39396#L61-3 assume true; 39397#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39389#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39390#L65 assume !(0 == mp_add_~i~0 % 256); 39379#L65-2 assume !(1 == mp_add_~i~0 % 256); 39376#L66-1 assume !(2 == mp_add_~i~0 % 256); 39372#L67-1 assume !(3 == mp_add_~i~0 % 256); 39368#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 39365#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39362#L76-1 assume !(0 == mp_add_~i~0 % 256); 39360#L80-1 assume !(1 == mp_add_~i~0 % 256); 39358#L81-1 assume !(2 == mp_add_~i~0 % 256); 39355#L82-1 assume !(3 == mp_add_~i~0 % 256); 39356#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39399#L61-3 assume true; 39393#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39394#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39385#L65 assume !(0 == mp_add_~i~0 % 256); 39386#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 39551#L66-1 [2018-11-18 17:31:33,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash -212911492, now seen corresponding path program 3 times [2018-11-18 17:31:33,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:33,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:33,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:33,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1496888549, now seen corresponding path program 1 times [2018-11-18 17:31:33,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:33,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:33,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 122 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:31:33,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:33,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:33,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:33,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 122 proven. 78 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:31:33,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:33,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-18 17:31:33,623 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:33,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 17:31:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-18 17:31:33,623 INFO L87 Difference]: Start difference. First operand 1025 states and 1149 transitions. cyclomatic complexity: 133 Second operand 12 states. [2018-11-18 17:31:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:35,246 INFO L93 Difference]: Finished difference Result 1810 states and 1972 transitions. [2018-11-18 17:31:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 17:31:35,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1810 states and 1972 transitions. [2018-11-18 17:31:35,249 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1527 [2018-11-18 17:31:35,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1810 states to 1783 states and 1945 transitions. [2018-11-18 17:31:35,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1783 [2018-11-18 17:31:35,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1783 [2018-11-18 17:31:35,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1783 states and 1945 transitions. [2018-11-18 17:31:35,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:35,252 INFO L705 BuchiCegarLoop]: Abstraction has 1783 states and 1945 transitions. [2018-11-18 17:31:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states and 1945 transitions. [2018-11-18 17:31:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1385. [2018-11-18 17:31:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-18 17:31:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1529 transitions. [2018-11-18 17:31:35,263 INFO L728 BuchiCegarLoop]: Abstraction has 1385 states and 1529 transitions. [2018-11-18 17:31:35,263 INFO L608 BuchiCegarLoop]: Abstraction has 1385 states and 1529 transitions. [2018-11-18 17:31:35,263 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 17:31:35,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 1529 transitions. [2018-11-18 17:31:35,266 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1274 [2018-11-18 17:31:35,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:35,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:35,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:35,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:35,267 INFO L794 eck$LassoCheckResult]: Stem: 42289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 42265#L40 assume !(0 == mp_add_~a3~0 % 256); 42261#L40-1 mp_add_~nb~0 := 4; 42262#L50 assume !(0 == mp_add_~b3~0 % 256); 42284#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 43397#L61-3 assume true; 43396#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43395#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43394#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 43393#L65-2 assume !(1 == mp_add_~i~0 % 256); 43392#L66-1 assume !(2 == mp_add_~i~0 % 256); 43391#L67-1 assume !(3 == mp_add_~i~0 % 256); 43390#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43389#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 43388#L71-2 assume !(1 == mp_add_~i~0 % 256); 43387#L72-1 assume !(2 == mp_add_~i~0 % 256); 43386#L73-1 assume !(3 == mp_add_~i~0 % 256); 43385#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 43384#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 43383#L80-1 assume !(1 == mp_add_~i~0 % 256); 43382#L81-1 assume !(2 == mp_add_~i~0 % 256); 43381#L82-1 assume !(3 == mp_add_~i~0 % 256); 43380#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43379#L61-3 assume true; 43378#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43377#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43376#L65 assume !(0 == mp_add_~i~0 % 256); 43375#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 42372#L66-1 [2018-11-18 17:31:35,267 INFO L796 eck$LassoCheckResult]: Loop: 42372#L66-1 assume !(2 == mp_add_~i~0 % 256); 43374#L67-1 assume !(3 == mp_add_~i~0 % 256); 43373#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43372#L71 assume !(0 == mp_add_~i~0 % 256); 43371#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 43370#L72-1 assume !(2 == mp_add_~i~0 % 256); 43369#L73-1 assume !(3 == mp_add_~i~0 % 256); 43368#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43367#L76-1 assume !(0 == mp_add_~i~0 % 256); 43366#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 43365#L81-1 assume !(2 == mp_add_~i~0 % 256); 43364#L82-1 assume !(3 == mp_add_~i~0 % 256); 43363#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43362#L61-3 assume true; 43361#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43360#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43325#L65 assume !(0 == mp_add_~i~0 % 256); 43320#L65-2 assume !(1 == mp_add_~i~0 % 256); 43319#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 43081#L67-1 assume !(3 == mp_add_~i~0 % 256); 43317#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43315#L71 assume !(0 == mp_add_~i~0 % 256); 43313#L71-2 assume !(1 == mp_add_~i~0 % 256); 43311#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 43309#L73-1 assume !(3 == mp_add_~i~0 % 256); 43305#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43303#L76-1 assume !(0 == mp_add_~i~0 % 256); 43301#L80-1 assume !(1 == mp_add_~i~0 % 256); 43299#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 43297#L82-1 assume !(3 == mp_add_~i~0 % 256); 43296#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43222#L61-3 assume true; 43223#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42999#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43000#L65 assume !(0 == mp_add_~i~0 % 256); 43250#L65-2 assume !(1 == mp_add_~i~0 % 256); 43249#L66-1 assume !(2 == mp_add_~i~0 % 256); 43248#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 43080#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43245#L71 assume !(0 == mp_add_~i~0 % 256); 43243#L71-2 assume !(1 == mp_add_~i~0 % 256); 43240#L72-1 assume !(2 == mp_add_~i~0 % 256); 43238#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 43045#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43225#L76-1 assume !(0 == mp_add_~i~0 % 256); 43224#L80-1 assume !(1 == mp_add_~i~0 % 256); 43119#L81-1 assume !(2 == mp_add_~i~0 % 256); 43076#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 43074#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42972#L61-3 assume true; 42973#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42964#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42626#L65 assume !(0 == mp_add_~i~0 % 256); 42621#L65-2 assume !(1 == mp_add_~i~0 % 256); 42622#L66-1 assume !(2 == mp_add_~i~0 % 256); 42613#L67-1 assume !(3 == mp_add_~i~0 % 256); 42614#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 42605#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 42606#L76-1 assume !(0 == mp_add_~i~0 % 256); 42601#L80-1 assume !(1 == mp_add_~i~0 % 256); 42602#L81-1 assume !(2 == mp_add_~i~0 % 256); 42597#L82-1 assume !(3 == mp_add_~i~0 % 256); 42598#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42593#L61-3 assume true; 42594#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42588#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42589#L65 assume !(0 == mp_add_~i~0 % 256); 42584#L65-2 assume !(1 == mp_add_~i~0 % 256); 42585#L66-1 assume !(2 == mp_add_~i~0 % 256); 42576#L67-1 assume !(3 == mp_add_~i~0 % 256); 42577#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 42568#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 42569#L76-1 assume !(0 == mp_add_~i~0 % 256); 42564#L80-1 assume !(1 == mp_add_~i~0 % 256); 42565#L81-1 assume !(2 == mp_add_~i~0 % 256); 42560#L82-1 assume !(3 == mp_add_~i~0 % 256); 42561#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42556#L61-3 assume true; 42557#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42551#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42552#L65 assume !(0 == mp_add_~i~0 % 256); 42547#L65-2 assume !(1 == mp_add_~i~0 % 256); 42548#L66-1 assume !(2 == mp_add_~i~0 % 256); 42541#L67-1 assume !(3 == mp_add_~i~0 % 256); 42542#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 43067#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 43066#L76-1 assume !(0 == mp_add_~i~0 % 256); 43065#L80-1 assume !(1 == mp_add_~i~0 % 256); 43064#L81-1 assume !(2 == mp_add_~i~0 % 256); 42447#L82-1 assume !(3 == mp_add_~i~0 % 256); 42448#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42439#L61-3 assume true; 42440#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42430#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42431#L65 assume !(0 == mp_add_~i~0 % 256); 42422#L65-2 assume !(1 == mp_add_~i~0 % 256); 42423#L66-1 assume !(2 == mp_add_~i~0 % 256); 42414#L67-1 assume !(3 == mp_add_~i~0 % 256); 42415#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 43062#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 43061#L76-1 assume !(0 == mp_add_~i~0 % 256); 43060#L80-1 assume !(1 == mp_add_~i~0 % 256); 43059#L81-1 assume !(2 == mp_add_~i~0 % 256); 42394#L82-1 assume !(3 == mp_add_~i~0 % 256); 42395#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42390#L61-3 assume true; 42391#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42377#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 42378#L65 assume !(0 == mp_add_~i~0 % 256); 42369#L65-2 assume !(1 == mp_add_~i~0 % 256); 42368#L66-1 assume !(2 == mp_add_~i~0 % 256); 42366#L67-1 assume !(3 == mp_add_~i~0 % 256); 42367#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 43041#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 43042#L76-1 assume !(0 == mp_add_~i~0 % 256); 43034#L80-1 assume !(1 == mp_add_~i~0 % 256); 43035#L81-1 assume !(2 == mp_add_~i~0 % 256); 42660#L82-1 assume !(3 == mp_add_~i~0 % 256); 42658#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 42659#L61-3 assume true; 42656#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 42657#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43022#L65 assume !(0 == mp_add_~i~0 % 256); 42370#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 42372#L66-1 [2018-11-18 17:31:35,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:35,267 INFO L82 PathProgramCache]: Analyzing trace with hash -212911492, now seen corresponding path program 4 times [2018-11-18 17:31:35,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:35,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:35,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 822576099, now seen corresponding path program 2 times [2018-11-18 17:31:35,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:35,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:35,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 182 proven. 200 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:31:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:35,402 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:31:35,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 17:31:35,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:31:35,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2018-11-18 17:31:35,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:31:35,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2018-11-18 17:31:35,495 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 17:31:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 17:31:35,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:31:35,496 INFO L87 Difference]: Start difference. First operand 1385 states and 1529 transitions. cyclomatic complexity: 153 Second operand 15 states. [2018-11-18 17:31:36,378 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 17:31:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:36,436 INFO L93 Difference]: Finished difference Result 1395 states and 1484 transitions. [2018-11-18 17:31:36,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 17:31:36,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1395 states and 1484 transitions. [2018-11-18 17:31:36,438 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 148 [2018-11-18 17:31:36,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1395 states to 1377 states and 1466 transitions. [2018-11-18 17:31:36,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1377 [2018-11-18 17:31:36,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1377 [2018-11-18 17:31:36,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1377 states and 1466 transitions. [2018-11-18 17:31:36,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:36,441 INFO L705 BuchiCegarLoop]: Abstraction has 1377 states and 1466 transitions. [2018-11-18 17:31:36,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states and 1466 transitions. [2018-11-18 17:31:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 375. [2018-11-18 17:31:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-18 17:31:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 403 transitions. [2018-11-18 17:31:36,444 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 403 transitions. [2018-11-18 17:31:36,444 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 403 transitions. [2018-11-18 17:31:36,444 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 17:31:36,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 403 transitions. [2018-11-18 17:31:36,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 17:31:36,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:36,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:36,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:36,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:36,445 INFO L794 eck$LassoCheckResult]: Stem: 45489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 45471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 45468#L40 assume !(0 == mp_add_~a3~0 % 256); 45464#L40-1 mp_add_~nb~0 := 4; 45465#L50 assume !(0 == mp_add_~b3~0 % 256); 45484#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 45698#L61-3 assume true; 45697#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 45696#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 45695#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 45694#L65-2 assume !(1 == mp_add_~i~0 % 256); 45693#L66-1 assume !(2 == mp_add_~i~0 % 256); 45692#L67-1 assume !(3 == mp_add_~i~0 % 256); 45691#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45690#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 45689#L71-2 assume !(1 == mp_add_~i~0 % 256); 45688#L72-1 assume !(2 == mp_add_~i~0 % 256); 45687#L73-1 assume !(3 == mp_add_~i~0 % 256); 45686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 45685#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 45684#L80-1 assume !(1 == mp_add_~i~0 % 256); 45683#L81-1 assume !(2 == mp_add_~i~0 % 256); 45682#L82-1 assume !(3 == mp_add_~i~0 % 256); 45681#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45680#L61-3 assume true; 45679#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 45678#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 45677#L65 assume !(0 == mp_add_~i~0 % 256); 45676#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 45675#L66-1 assume !(2 == mp_add_~i~0 % 256); 45674#L67-1 assume !(3 == mp_add_~i~0 % 256); 45673#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45672#L71 assume !(0 == mp_add_~i~0 % 256); 45671#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 45670#L72-1 assume !(2 == mp_add_~i~0 % 256); 45669#L73-1 assume !(3 == mp_add_~i~0 % 256); 45668#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 45667#L76-1 assume !(0 == mp_add_~i~0 % 256); 45666#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 45665#L81-1 assume !(2 == mp_add_~i~0 % 256); 45664#L82-1 assume !(3 == mp_add_~i~0 % 256); 45663#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45662#L61-3 assume true; 45661#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 45659#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45660#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45704#L71 assume !(0 == mp_add_~i~0 % 256); 45703#L71-2 assume !(1 == mp_add_~i~0 % 256); 45702#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 45701#L73-1 assume !(3 == mp_add_~i~0 % 256); 45699#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 45700#L76-1 assume !(0 == mp_add_~i~0 % 256); 45642#L80-1 assume !(1 == mp_add_~i~0 % 256); 45643#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 45634#L82-1 assume !(3 == mp_add_~i~0 % 256); 45635#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45626#L61-3 assume true; 45627#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 45619#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45618#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 45610#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 45607#L76-1 assume !(0 == mp_add_~i~0 % 256); 45606#L80-1 assume !(1 == mp_add_~i~0 % 256); 45605#L81-1 assume !(2 == mp_add_~i~0 % 256); 45603#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 45602#L83-1 [2018-11-18 17:31:36,445 INFO L796 eck$LassoCheckResult]: Loop: 45602#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45601#L61-3 assume true; 45600#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 45487#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45488#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45758#L71 assume !(0 == mp_add_~i~0 % 256); 45796#L71-2 assume !(1 == mp_add_~i~0 % 256); 45795#L72-1 assume !(2 == mp_add_~i~0 % 256); 45756#L73-1 assume !(3 == mp_add_~i~0 % 256); 45755#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 45754#L76-1 assume !(0 == mp_add_~i~0 % 256); 45753#L80-1 assume !(1 == mp_add_~i~0 % 256); 45752#L81-1 assume !(2 == mp_add_~i~0 % 256); 45604#L82-1 assume !(3 == mp_add_~i~0 % 256); 45602#L83-1 [2018-11-18 17:31:36,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:36,446 INFO L82 PathProgramCache]: Analyzing trace with hash 177357928, now seen corresponding path program 1 times [2018-11-18 17:31:36,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:36,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:36,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:36,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-18 17:31:36,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:36,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:36,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-18 17:31:36,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:36,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-18 17:31:36,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 17:31:36,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 1 times [2018-11-18 17:31:36,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:36,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:36,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:36,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:36,594 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:36,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:36,595 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:36,595 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:36,595 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:36,595 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:36,595 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:36,595 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:36,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration23_Loop [2018-11-18 17:31:36,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:36,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:36,595 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-18 17:31:36,606 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-18 17:31:36,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:36,722 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:36,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:36,726 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:36,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:36,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:37,995 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:37,997 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:37,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:37,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:37,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:37,997 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:37,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:37,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:37,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:37,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration23_Loop [2018-11-18 17:31:37,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:37,998 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:37,998 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-18 17:31:38,009 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-18 17:31:38,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:38,118 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:38,118 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-18 17:31:38,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:38,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:38,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:38,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:38,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:38,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,122 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:38,122 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-18 17:31:38,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:38,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:38,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,125 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-18 17:31:38,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:38,126 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:38,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,127 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:38,127 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-18 17:31:38,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,128 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,131 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-18 17:31:38,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,132 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:38,132 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-18 17:31:38,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,133 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:38,134 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:38,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,137 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-18 17:31:38,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:38,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,137 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:38,138 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:38,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,138 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:38,139 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-18 17:31:38,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,139 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:38,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,139 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:38,140 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:38,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,145 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-18 17:31:38,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,145 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:38,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,145 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:38,146 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:38,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,147 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:38,147 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-18 17:31:38,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,147 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:38,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,148 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,149 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:38,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,154 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:38,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,155 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,157 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:38,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:38,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:38,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,158 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:38,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:38,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,167 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-18 17:31:38,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,167 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:38,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,168 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:38,169 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:38,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,170 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:38,170 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-18 17:31:38,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:38,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,171 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,176 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-18 17:31:38,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,176 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:38,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:38,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:38,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,179 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:38,179 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-18 17:31:38,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,179 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:38,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,180 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:38,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:38,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 17:31:38,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:38,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:38,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:38,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:38,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:38,193 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:38,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:38,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:38,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:31:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:31:38,197 INFO L87 Difference]: Start difference. First operand 375 states and 403 transitions. cyclomatic complexity: 31 Second operand 8 states. [2018-11-18 17:31:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:38,410 INFO L93 Difference]: Finished difference Result 384 states and 407 transitions. [2018-11-18 17:31:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:31:38,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 384 states and 407 transitions. [2018-11-18 17:31:38,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 70 [2018-11-18 17:31:38,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 384 states to 355 states and 377 transitions. [2018-11-18 17:31:38,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-18 17:31:38,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2018-11-18 17:31:38,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 355 states and 377 transitions. [2018-11-18 17:31:38,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:38,412 INFO L705 BuchiCegarLoop]: Abstraction has 355 states and 377 transitions. [2018-11-18 17:31:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states and 377 transitions. [2018-11-18 17:31:38,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 325. [2018-11-18 17:31:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-18 17:31:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 347 transitions. [2018-11-18 17:31:38,414 INFO L728 BuchiCegarLoop]: Abstraction has 325 states and 347 transitions. [2018-11-18 17:31:38,414 INFO L608 BuchiCegarLoop]: Abstraction has 325 states and 347 transitions. [2018-11-18 17:31:38,414 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 17:31:38,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 347 transitions. [2018-11-18 17:31:38,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 64 [2018-11-18 17:31:38,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:38,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:38,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:38,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:38,415 INFO L794 eck$LassoCheckResult]: Stem: 46458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 46438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 46435#L40 assume !(0 == mp_add_~a3~0 % 256); 46431#L40-1 mp_add_~nb~0 := 4; 46432#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46454#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46440#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46442#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 46524#L61-3 assume true; 46523#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46522#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46521#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 46520#L65-2 assume !(1 == mp_add_~i~0 % 256); 46519#L66-1 assume !(2 == mp_add_~i~0 % 256); 46518#L67-1 assume !(3 == mp_add_~i~0 % 256); 46517#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 46460#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 46425#L71-2 assume !(1 == mp_add_~i~0 % 256); 46426#L72-1 assume !(2 == mp_add_~i~0 % 256); 46433#L73-1 assume !(3 == mp_add_~i~0 % 256); 46434#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 46439#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 46423#L80-1 assume !(1 == mp_add_~i~0 % 256); 46424#L81-1 assume !(2 == mp_add_~i~0 % 256); 46427#L82-1 assume !(3 == mp_add_~i~0 % 256); 46428#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46446#L61-3 assume true; 46447#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46736#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46443#L65 assume !(0 == mp_add_~i~0 % 256); 46436#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 46437#L66-1 assume !(2 == mp_add_~i~0 % 256); 46734#L67-1 assume !(3 == mp_add_~i~0 % 256); 46733#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46732#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 46731#L76-1 assume !(0 == mp_add_~i~0 % 256); 46730#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 46729#L81-1 assume !(2 == mp_add_~i~0 % 256); 46728#L82-1 assume !(3 == mp_add_~i~0 % 256); 46727#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46726#L61-3 assume true; 46725#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46724#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46723#L65 assume !(0 == mp_add_~i~0 % 256); 46722#L65-2 assume !(1 == mp_add_~i~0 % 256); 46721#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 46720#L67-1 assume !(3 == mp_add_~i~0 % 256); 46719#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46718#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 46717#L76-1 assume !(0 == mp_add_~i~0 % 256); 46716#L80-1 assume !(1 == mp_add_~i~0 % 256); 46715#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 46714#L82-1 assume !(3 == mp_add_~i~0 % 256); 46713#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46712#L61-3 assume true; 46711#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46710#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46709#L65 assume !(0 == mp_add_~i~0 % 256); 46708#L65-2 assume !(1 == mp_add_~i~0 % 256); 46707#L66-1 assume !(2 == mp_add_~i~0 % 256); 46705#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 46706#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46747#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 46745#L76-1 assume !(0 == mp_add_~i~0 % 256); 46743#L80-1 assume !(1 == mp_add_~i~0 % 256); 46741#L81-1 assume !(2 == mp_add_~i~0 % 256); 46739#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 46738#L83-1 [2018-11-18 17:31:38,415 INFO L796 eck$LassoCheckResult]: Loop: 46738#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46737#L61-3 assume true; 46449#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46450#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46457#L65 assume !(0 == mp_add_~i~0 % 256); 46735#L65-2 assume !(1 == mp_add_~i~0 % 256); 46459#L66-1 assume !(2 == mp_add_~i~0 % 256); 46444#L67-1 assume !(3 == mp_add_~i~0 % 256); 46445#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46456#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 46746#L76-1 assume !(0 == mp_add_~i~0 % 256); 46744#L80-1 assume !(1 == mp_add_~i~0 % 256); 46742#L81-1 assume !(2 == mp_add_~i~0 % 256); 46740#L82-1 assume !(3 == mp_add_~i~0 % 256); 46738#L83-1 [2018-11-18 17:31:38,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:38,416 INFO L82 PathProgramCache]: Analyzing trace with hash 671857223, now seen corresponding path program 1 times [2018-11-18 17:31:38,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:38,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:38,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 1 times [2018-11-18 17:31:38,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:38,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 264905159, now seen corresponding path program 2 times [2018-11-18 17:31:38,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:38,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 64 proven. 34 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 17:31:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:38,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:31:38,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 17:31:38,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:31:38,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-18 17:31:38,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:38,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-11-18 17:31:38,808 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:38,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:38,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:38,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:38,809 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:38,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:38,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:38,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:38,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 17:31:38,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:38,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:38,810 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-18 17:31:38,817 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-18 17:31:38,960 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:38,961 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:38,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:38,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:38,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 17:31:38,967 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:38,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:38,984 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:39,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:39,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:39,351 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:39,353 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:39,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:39,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:39,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:39,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:39,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:39,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:39,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:39,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 17:31:39,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:39,353 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:39,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:31:39,357 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-18 17:31:39,473 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:39,473 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:39,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-18 17:31:39,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:39,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:39,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,475 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-18 17:31:39,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:39,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:39,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,477 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:39,477 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-18 17:31:39,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:39,478 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:39,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,478 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-18 17:31:39,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:39,479 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:39,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,480 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:39,480 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-18 17:31:39,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,480 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,481 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-18 17:31:39,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,482 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,483 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:39,483 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-18 17:31:39,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,484 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:39,484 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:39,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,484 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-18 17:31:39,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:39,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,485 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:39,485 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:39,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,487 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:39,487 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-18 17:31:39,488 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,488 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:39,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:39,489 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:39,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,489 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-18 17:31:39,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,489 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:39,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:39,490 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:39,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,495 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:39,495 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-18 17:31:39,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,495 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:39,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,496 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,497 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-18 17:31:39,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,498 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:39,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,502 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:39,502 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-18 17:31:39,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,502 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:39,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,503 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:39,503 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:39,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,504 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-18 17:31:39,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:39,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,504 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:39,505 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:39,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,513 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:39,514 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-18 17:31:39,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,514 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:39,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,514 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,517 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-18 17:31:39,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,517 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:39,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,518 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:39,518 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:39,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,522 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:39,522 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-18 17:31:39,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,523 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:39,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,523 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:39,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:39,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,527 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-18 17:31:39,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:39,528 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:39,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:39,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:39,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:39,528 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:39,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:39,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:39,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:39,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 17:31:39,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:31:39,538 INFO L87 Difference]: Start difference. First operand 325 states and 347 transitions. cyclomatic complexity: 26 Second operand 15 states. [2018-11-18 17:31:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:40,062 INFO L93 Difference]: Finished difference Result 288 states and 304 transitions. [2018-11-18 17:31:40,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 17:31:40,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 288 states and 304 transitions. [2018-11-18 17:31:40,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 17:31:40,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 288 states to 148 states and 156 transitions. [2018-11-18 17:31:40,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2018-11-18 17:31:40,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-11-18 17:31:40,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 156 transitions. [2018-11-18 17:31:40,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:40,064 INFO L705 BuchiCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-11-18 17:31:40,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 156 transitions. [2018-11-18 17:31:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2018-11-18 17:31:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 17:31:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-11-18 17:31:40,065 INFO L728 BuchiCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-11-18 17:31:40,065 INFO L608 BuchiCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-11-18 17:31:40,065 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 17:31:40,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 151 transitions. [2018-11-18 17:31:40,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 17:31:40,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 17:31:40,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 17:31:40,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:40,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:31:40,066 INFO L794 eck$LassoCheckResult]: Stem: 47348#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 47329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 47326#L40 assume !(0 == mp_add_~a3~0 % 256); 47322#L40-1 mp_add_~nb~0 := 4; 47323#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 47344#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 47332#L54 assume !(0 == mp_add_~b1~0 % 256); 47333#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 47364#L61-3 assume true; 47365#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47360#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47361#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 47356#L65-2 assume !(1 == mp_add_~i~0 % 256); 47357#L66-1 assume !(2 == mp_add_~i~0 % 256); 47352#L67-1 assume !(3 == mp_add_~i~0 % 256); 47353#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47349#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 47316#L71-2 assume !(1 == mp_add_~i~0 % 256); 47317#L72-1 assume !(2 == mp_add_~i~0 % 256); 47445#L73-1 assume !(3 == mp_add_~i~0 % 256); 47444#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 47443#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 47442#L80-1 assume !(1 == mp_add_~i~0 % 256); 47441#L81-1 assume !(2 == mp_add_~i~0 % 256); 47440#L82-1 assume !(3 == mp_add_~i~0 % 256); 47439#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47438#L61-3 assume true; 47437#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47436#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47334#L65 assume !(0 == mp_add_~i~0 % 256); 47327#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 47328#L66-1 assume !(2 == mp_add_~i~0 % 256); 47335#L67-1 assume !(3 == mp_add_~i~0 % 256); 47336#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47366#L71 assume !(0 == mp_add_~i~0 % 256); 47369#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 47370#L72-1 assume !(2 == mp_add_~i~0 % 256); 47410#L73-1 assume !(3 == mp_add_~i~0 % 256); 47407#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 47404#L76-1 assume !(0 == mp_add_~i~0 % 256); 47401#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 47398#L81-1 assume !(2 == mp_add_~i~0 % 256); 47395#L82-1 assume !(3 == mp_add_~i~0 % 256); 47392#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47389#L61-3 assume true; 47386#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47383#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47380#L65 assume !(0 == mp_add_~i~0 % 256); 47377#L65-2 assume !(1 == mp_add_~i~0 % 256); 47375#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 47372#L67-1 assume !(3 == mp_add_~i~0 % 256); 47373#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 47405#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 47402#L76-1 assume !(0 == mp_add_~i~0 % 256); 47399#L80-1 assume !(1 == mp_add_~i~0 % 256); 47396#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 47393#L82-1 assume !(3 == mp_add_~i~0 % 256); 47390#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47387#L61-3 assume true; 47384#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47381#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47378#L65 assume !(0 == mp_add_~i~0 % 256); 47376#L65-2 assume !(1 == mp_add_~i~0 % 256); 47374#L66-1 assume !(2 == mp_add_~i~0 % 256); 47371#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 47345#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 47346#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 47455#L76-1 assume !(0 == mp_add_~i~0 % 256); 47314#L80-1 assume !(1 == mp_add_~i~0 % 256); 47315#L81-1 assume !(2 == mp_add_~i~0 % 256); 47456#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 47319#L83-1 [2018-11-18 17:31:40,066 INFO L796 eck$LassoCheckResult]: Loop: 47319#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47337#L61-3 assume true; 47338#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 47342#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47347#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47320#L71 assume !(0 == mp_add_~i~0 % 256); 47321#L71-2 assume !(1 == mp_add_~i~0 % 256); 47343#L72-1 assume !(2 == mp_add_~i~0 % 256); 47324#L73-1 assume !(3 == mp_add_~i~0 % 256); 47325#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 47330#L76-1 assume !(0 == mp_add_~i~0 % 256); 47331#L80-1 assume !(1 == mp_add_~i~0 % 256); 47339#L81-1 assume !(2 == mp_add_~i~0 % 256); 47318#L82-1 assume !(3 == mp_add_~i~0 % 256); 47319#L83-1 [2018-11-18 17:31:40,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash -567689255, now seen corresponding path program 1 times [2018-11-18 17:31:40,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:40,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:40,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:40,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 2 times [2018-11-18 17:31:40,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:40,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:31:40,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:31:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -805186379, now seen corresponding path program 1 times [2018-11-18 17:31:40,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:31:40,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:31:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:31:40,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:31:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 17:31:40,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:31:40,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:31:40,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:31:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:31:40,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:31:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 17:31:40,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:31:40,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-18 17:31:40,413 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:40,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:40,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:40,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:40,413 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 17:31:40,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:40,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:40,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:40,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 17:31:40,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:40,413 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:40,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-18 17:31:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 17:31:40,537 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:40,537 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:40,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 17:31:40,543 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_479a7dc1-9d31-4f8d-ad3f-fec55cc5d822/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:40,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 17:31:40,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 17:31:41,347 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 17:31:41,349 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 17:31:41,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 17:31:41,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 17:31:41,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 17:31:41,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 17:31:41,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 17:31:41,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 17:31:41,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 17:31:41,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 17:31:41,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 17:31:41,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 17:31:41,350 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-18 17:31:41,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-18 17:31:41,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 17:31:41,472 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 17:31:41,472 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-18 17:31:41,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:41,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:41,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,473 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-18 17:31:41,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 17:31:41,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 17:31:41,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,475 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 17:31:41,475 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-18 17:31:41,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:41,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:41,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,476 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-18 17:31:41,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,476 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:41,476 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:41,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,477 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 17:31:41,477 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-18 17:31:41,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,478 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,478 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-18 17:31:41,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,479 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,481 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 17:31:41,481 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-18 17:31:41,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:41,481 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:41,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,482 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-18 17:31:41,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 17:31:41,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,482 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:41,482 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:41,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,484 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 17:31:41,484 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-18 17:31:41,484 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,484 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:41,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:41,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:41,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,485 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-18 17:31:41,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:41,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 17:31:41,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 17:31:41,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,489 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 17:31:41,489 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-18 17:31:41,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,489 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:41,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,489 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,491 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-18 17:31:41,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,491 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 17:31:41,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,496 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 17:31:41,496 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-18 17:31:41,497 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,497 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:41,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:41,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:41,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,498 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-18 17:31:41,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,498 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:41,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,499 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 17:31:41,500 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 17:31:41,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,504 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 17:31:41,504 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-18 17:31:41,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,504 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:41,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,505 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,506 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-18 17:31:41,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,506 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 17:31:41,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,507 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 17:31:41,507 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 17:31:41,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,510 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 17:31:41,511 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-18 17:31:41,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:41,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,511 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:41,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:41,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,515 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-18 17:31:41,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 17:31:41,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 17:31:41,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 17:31:41,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 17:31:41,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 17:31:41,516 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 17:31:41,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 17:31:41,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 17:31:41,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 17:31:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:31:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:31:41,522 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-18 17:31:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:31:41,940 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-18 17:31:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 17:31:41,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 190 transitions. [2018-11-18 17:31:41,940 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 17:31:41,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2018-11-18 17:31:41,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 17:31:41,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 17:31:41,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 17:31:41,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 17:31:41,941 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:31:41,941 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:31:41,941 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:31:41,941 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 17:31:41,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:31:41,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 17:31:41,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 17:31:41,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 05:31:41 BoogieIcfgContainer [2018-11-18 17:31:41,946 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 17:31:41,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:31:41,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:31:41,946 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:31:41,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:30:48" (3/4) ... [2018-11-18 17:31:41,948 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 17:31:41,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:31:41,949 INFO L168 Benchmark]: Toolchain (without parser) took 53834.63 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 698.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -114.1 MB). Peak memory consumption was 584.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,949 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:31:41,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,950 INFO L168 Benchmark]: Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,950 INFO L168 Benchmark]: RCFGBuilder took 222.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,951 INFO L168 Benchmark]: BuchiAutomizer took 53339.84 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 599.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:31:41,951 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:31:41,952 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.10 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 222.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 53339.84 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 534.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.7 MB). Peak memory consumption was 599.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.3s and 26 iterations. TraceHistogramMax:8. Analysis of lassos took 43.4s. Construction of modules took 6.8s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 8500 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2876 states and ocurred in iteration 16. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 958 SDtfs, 4424 SDslu, 2034 SDs, 0 SdLazy, 8196 SolverSat, 664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time LassoAnalysisResults: nont0 unkn0 SFLI13 SFLT0 conc4 concLT0 SILN0 SILU4 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf97 lsp67 ukn100 mio100 lsp100 div592 bol100 ite100 ukn100 eq142 hnf41 smp82 dnf100 smp100 tf102 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 3ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 29.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...