./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/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 a8726e54e507f4e5407a6f1ab8a73f56b359228a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:56:57,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:56:57,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:56:57,698 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:56:57,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:56:57,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:56:57,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:56:57,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:56:57,703 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:56:57,704 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:56:57,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:56:57,704 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:56:57,705 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:56:57,706 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:56:57,707 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:56:57,707 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:56:57,708 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:56:57,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:56:57,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:56:57,711 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:56:57,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:56:57,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:56:57,714 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:56:57,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:56:57,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:56:57,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:56:57,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:56:57,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:56:57,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:56:57,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:56:57,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:56:57,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:56:57,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:56:57,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:56:57,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:56:57,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:56:57,720 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:56:57,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:56:57,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:56:57,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:56:57,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:56:57,734 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:56:57,734 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:56:57,734 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:56:57,734 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:56:57,734 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:56:57,735 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:56:57,735 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:56:57,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:56:57,737 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:56:57,737 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:56:57,737 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:56:57,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:56:57,737 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:56:57,737 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:56:57,738 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:56:57,738 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_c5e7a5b2-bcad-4f30-ad10-338781c9d255/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 -> a8726e54e507f4e5407a6f1ab8a73f56b359228a [2018-11-10 06:56:57,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:56:57,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:56:57,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:56:57,780 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:56:57,780 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:56:57,780 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c [2018-11-10 06:56:57,832 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/data/c332b8147/3bbe878601ae447aacd46b5cabf2699b/FLAGd8ab6cc0a [2018-11-10 06:56:58,211 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:56:58,212 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/sv-benchmarks/c/eca-rers2012/Problem02_label42_true-unreach-call_false-termination.c [2018-11-10 06:56:58,222 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/data/c332b8147/3bbe878601ae447aacd46b5cabf2699b/FLAGd8ab6cc0a [2018-11-10 06:56:58,234 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/data/c332b8147/3bbe878601ae447aacd46b5cabf2699b [2018-11-10 06:56:58,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:56:58,238 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:56:58,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:56:58,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:56:58,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:56:58,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce791db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58, skipping insertion in model container [2018-11-10 06:56:58,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:56:58,299 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:56:58,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:56:58,557 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:56:58,633 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:56:58,649 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:56:58,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58 WrapperNode [2018-11-10 06:56:58,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:56:58,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:56:58,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:56:58,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:56:58,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:56:58,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:56:58,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:56:58,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:56:58,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... [2018-11-10 06:56:58,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:56:58,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:56:58,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:56:58,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:56:58,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:56:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:56:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:56:59,824 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:56:59,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:56:59 BoogieIcfgContainer [2018-11-10 06:56:59,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:56:59,825 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:56:59,825 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:56:59,829 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:56:59,829 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:56:59,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:56:58" (1/3) ... [2018-11-10 06:56:59,830 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b33fb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:56:59, skipping insertion in model container [2018-11-10 06:56:59,830 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:56:59,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:56:58" (2/3) ... [2018-11-10 06:56:59,831 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b33fb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:56:59, skipping insertion in model container [2018-11-10 06:56:59,831 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:56:59,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:56:59" (3/3) ... [2018-11-10 06:56:59,833 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label42_true-unreach-call_false-termination.c [2018-11-10 06:56:59,873 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:56:59,874 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:56:59,874 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:56:59,875 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:56:59,875 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:56:59,875 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:56:59,875 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:56:59,875 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:56:59,875 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:56:59,893 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:56:59,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:56:59,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:59,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:59,932 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:56:59,932 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:56:59,932 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:56:59,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:56:59,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:56:59,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:56:59,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:56:59,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:56:59,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:56:59,948 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 06:56:59,948 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 06:56:59,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:56:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 06:56:59,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:56:59,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:56:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:56:59,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:56:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:00,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 06:57:00,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:00,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:00,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 06:57:00,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:00,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:00,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:00,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:00,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:57:00,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:57:00,310 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:00,310 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:00,310 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:00,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:00,311 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:57:00,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:00,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:00,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label42_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:57:00,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:00,312 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:00,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:00,605 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:57:00,606 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,645 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,646 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,706 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,707 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/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) [2018-11-10 06:57:00,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,747 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,781 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,781 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,805 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,805 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,876 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,877 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,891 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,898 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,898 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:00,946 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:00,946 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:00,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:00,982 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:01,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:57:01,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:01,088 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:57:01,089 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:01,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:01,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:01,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:01,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:57:01,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:01,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:01,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:01,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label42_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:57:01,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:01,091 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:01,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:01,442 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:57:01,448 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:57:01,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-10 06:57:01,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,481 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:01,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:01,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:01,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:01,540 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,547 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:57:01,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,549 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,552 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,564 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,572 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,575 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:57:01,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,596 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,606 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,645 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,646 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:01,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:01,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,660 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:57:01,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,676 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,684 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,684 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,689 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:01,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,708 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:01,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,732 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:01,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,740 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:57:01,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,746 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,755 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,756 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,760 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,762 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:57:01,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,777 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,783 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,783 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,790 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:01,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:01,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:01,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:01,797 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:01,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,803 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:57:01,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-10 06:57:01,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,804 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,804 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,806 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,825 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,829 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,830 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,832 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:57:01,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,868 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,869 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,879 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,880 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,884 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,884 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,884 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,889 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:01,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:01,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,897 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:01,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:01,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:01,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,905 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:57:01,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-10 06:57:01,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,908 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,928 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,929 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,935 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,936 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:01,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,942 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:01,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,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-10 06:57:01,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,983 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,992 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:01,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:01,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:01,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:01,998 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:01,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:01,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:01,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:01,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:01,999 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:01,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,004 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:02,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,005 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,008 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:02,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:02,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,011 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:02,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,025 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:57:02,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-10 06:57:02,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,028 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,031 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,049 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,050 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,056 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,057 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:02,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,062 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:57:02,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,124 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,131 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,132 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,140 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,141 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:02,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,144 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:02,144 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:02,146 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:02,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,159 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:57:02,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-10 06:57:02,160 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,160 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,161 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,162 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,182 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:02,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,184 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:02,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,205 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,206 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,216 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,220 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:02,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,227 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:02,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:02,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:02,228 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:02,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,235 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:57:02,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,237 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,268 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,273 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,273 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:57:02,273 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,277 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 06:57:02,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,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-10 06:57:02,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,355 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,371 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,371 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,376 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,377 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,381 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:02,382 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:02,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:02,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:02,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:02,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:02,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:02,387 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:02,387 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:02,388 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:02,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:02,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:02,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:57:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:57:02,416 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 06:57:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:03,150 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 06:57:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:57:03,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 06:57:03,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 06:57:03,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 06:57:03,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 06:57:03,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 06:57:03,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 06:57:03,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:03,176 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 06:57:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 06:57:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 06:57:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 06:57:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 06:57:03,217 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 06:57:03,217 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 06:57:03,217 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:57:03,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 06:57:03,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 06:57:03,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:03,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:03,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:03,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:57:03,221 INFO L793 eck$LassoCheckResult]: Stem: 750#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-10 06:57:03,222 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 851#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 733#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 878#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 759#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 693#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 694#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 845#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 633#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-10 06:57:03,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:03,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 06:57:03,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:03,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:03,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:03,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 06:57:03,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:03,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:03,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:57:03,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:03,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:03,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 06:57:03,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:57:03,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:03,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:57:03,396 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-10 06:57:03,420 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:03,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:03,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:03,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:03,420 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:57:03,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:03,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:03,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label42_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:57:03,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:03,421 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:03,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,573 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:57:03,573 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,595 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:03,595 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,602 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:03,602 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,623 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:03,623 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,644 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:03,644 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,679 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:03,679 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:03,683 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:57:03,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:03,735 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:57:03,736 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:03,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:03,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:03,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:03,737 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:57:03,737 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:03,737 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:03,737 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:03,737 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label42_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:57:03,737 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:03,737 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:03,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:03,913 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:57:03,913 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:57:03,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,915 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:03,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:03,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,918 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:03,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:03,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,924 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,924 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:57:03,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:57:03,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,932 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:57:03,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:03,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,935 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,936 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:03,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,938 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,938 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:03,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,940 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:03,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,942 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:03,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,943 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:03,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,947 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:03,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:03,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:03,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,954 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:57:03,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,955 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,957 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,958 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,960 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,960 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,960 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:03,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,962 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,964 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,964 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,966 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,966 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:03,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,970 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:03,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:03,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:03,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,978 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:57:03,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-10 06:57:03,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,980 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:03,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,982 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,982 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:03,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,985 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,986 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:03,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:03,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:03,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,989 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:03,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:03,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,991 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,992 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:03,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:03,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:03,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-10 06:57:03,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:03,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:03,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:03,995 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:03,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:03,996 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:03,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:57:04,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,002 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,002 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,005 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:57:04,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,006 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,007 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:04,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,009 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,010 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:04,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,013 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,014 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:04,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:04,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,020 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,025 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,033 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:57:04,034 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:57:04,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,037 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:57:04,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,038 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,038 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,047 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,048 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,048 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,051 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,051 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,051 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,053 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,057 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,057 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,057 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,058 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,064 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,064 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,064 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,066 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,080 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:57:04,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,086 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:57:04,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,087 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,087 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,088 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,092 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,101 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,101 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,101 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,111 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:04,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,113 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,114 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,115 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,116 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,121 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,125 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:04,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,134 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,135 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,135 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,137 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:57:04,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,162 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,162 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:57:04,164 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:57:04,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,175 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:57:04,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,176 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,179 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,184 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,189 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,190 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,191 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,193 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,193 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,193 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,194 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,199 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,200 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,201 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:57:04,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,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-10 06:57:04,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:57:04,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:57:04,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:57:04,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,217 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:57:04,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,218 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,218 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,222 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,222 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,231 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,231 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,232 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:04,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,235 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,235 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,238 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,238 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,239 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,244 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:04,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,253 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:57:04,253 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,255 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:57:04,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:57:04,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:57:04,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:57:04,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:57:04,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:57:04,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:57:04,287 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:57:04,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:57:04,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:57:04,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:57:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:57:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:57:04,311 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 06:57:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:04,753 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 06:57:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:57:04,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 06:57:04,756 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 06:57:04,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 06:57:04,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 06:57:04,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 06:57:04,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 06:57:04,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:04,764 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:57:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 06:57:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 06:57:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 06:57:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 06:57:04,783 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:57:04,783 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 06:57:04,783 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:57:04,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 06:57:04,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 06:57:04,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:04,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:04,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:04,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 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, 1, 1, 1, 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-10 06:57:04,788 INFO L793 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 06:57:04,789 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1901#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1774#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1923#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2294#L606-3 assume true; 2293#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2292#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2291#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2290#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2289#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2288#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2287#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2286#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2284#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2282#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2280#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2278#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2277#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2276#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2274#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2272#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2013#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2014#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2285#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2283#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2281#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2279#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2011#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2012#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2267#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2265#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2263#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2261#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2259#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2257#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2015#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2016#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2115#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2109#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2108#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2107#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2106#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2105#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2104#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2102#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2100#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2098#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2095#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2093#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1815#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 06:57:04,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 06:57:04,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:04,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:04,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 06:57:04,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:04,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:04,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:04,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:57:04,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:57:04,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:04,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:57:04,863 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:57:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:57:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:57:04,863 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 06:57:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:05,534 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-10 06:57:05,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:57:05,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-10 06:57:05,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 06:57:05,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-10 06:57:05,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 06:57:05,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 06:57:05,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-10 06:57:05,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:05,597 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-10 06:57:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-10 06:57:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 06:57:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 06:57:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-10 06:57:05,617 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 06:57:05,617 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 06:57:05,617 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:57:05,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-10 06:57:05,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 06:57:05,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:05,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:05,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:05,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 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, 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-10 06:57:05,623 INFO L793 eck$LassoCheckResult]: Stem: 3689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 06:57:05,624 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4551#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4547#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4543#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4539#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4540#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4682#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3828#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 3829#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3753#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4246#L606-3 assume true; 4244#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4242#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4240#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3711#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4457#L606-3 assume true; 4455#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4453#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4452#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4451#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4262#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 3627#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3628#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4534#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4745#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4406#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4404#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4402#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4400#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4397#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4395#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4394#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4393#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4391#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4389#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4386#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4346#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4345#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4052#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4053#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 3663#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 3664#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 3665#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 3666#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4066#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4263#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4264#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4330#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4273#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4274#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4401#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4399#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4254#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4255#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4046#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4047#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4493#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4265#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4266#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4378#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4375#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4372#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4369#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4367#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4365#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4119#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 06:57:05,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 06:57:05,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:05,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 06:57:05,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:05,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:57:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:57:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:57:05,661 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:57:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:57:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:57:05,665 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-10 06:57:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:06,095 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-10 06:57:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:57:06,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-10 06:57:06,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 06:57:06,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-10 06:57:06,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 06:57:06,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 06:57:06,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-10 06:57:06,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:06,117 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-10 06:57:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-10 06:57:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 06:57:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 06:57:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-10 06:57:06,138 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 06:57:06,138 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 06:57:06,138 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:57:06,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-10 06:57:06,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:57:06,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:06,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:06,147 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:06,147 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:57:06,147 INFO L793 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 06:57:06,148 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 6548#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6410#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6411#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6610#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6439#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6370#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6371#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6541#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6309#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6310#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6320#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7714#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7713#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7712#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7711#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7710#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7709#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6798#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6540#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6793#L606-3 assume true; 6791#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6789#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6787#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6451#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7458#L606-3 assume true; 7457#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7456#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7455#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7454#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7453#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7452#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7451#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7450#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7449#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7448#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7446#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7443#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7440#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7437#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7434#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7431#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7428#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7416#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7413#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7410#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7406#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7402#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7398#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7293#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7292#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7291#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7289#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7286#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7283#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7280#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7277#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7274#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7271#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7268#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7265#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7262#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7259#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7256#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7253#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7250#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7247#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7244#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7241#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7238#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7235#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7232#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7229#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7226#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7223#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6456#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 06:57:06,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 06:57:06,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 06:57:06,153 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:57:06,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:57:06,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:06,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:57:06,181 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:57:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:57:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:57:06,181 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-10 06:57:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:06,548 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 06:57:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:57:06,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 06:57:06,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:57:06,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 06:57:06,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 06:57:06,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 06:57:06,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 06:57:06,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:06,560 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 06:57:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 06:57:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 06:57:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 06:57:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 06:57:06,572 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 06:57:06,572 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 06:57:06,572 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:57:06,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 06:57:06,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:57:06,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:06,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:06,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:06,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-11-10 06:57:06,578 INFO L793 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 06:57:06,579 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10372#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10370#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10368#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10366#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10364#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10362#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10360#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10212#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10213#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10207#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9332#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9333#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9577#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9469#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9470#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9521#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9452#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9453#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9584#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9398#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9399#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10683#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10682#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10681#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10680#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10678#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10677#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10676#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9867#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9710#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9864#L606-3 assume true; 9862#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9860#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9858#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9856#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9854#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9852#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9850#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9848#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9845#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9843#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9841#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9839#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9837#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9835#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9833#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9831#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9829#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9827#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9825#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9823#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9821#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9819#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9817#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9815#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9813#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9811#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9809#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9807#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9805#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9803#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9801#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9799#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9797#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9795#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9793#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9791#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9789#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9787#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9785#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9783#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9781#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9778#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9776#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9774#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9772#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9770#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9768#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9766#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9763#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9764#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 06:57:06,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 06:57:06,579 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:06,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 06:57:06,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:57:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:57:06,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:06,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:57:06,644 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:57:06,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:57:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:57:06,644 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 06:57:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:06,833 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 06:57:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:57:06,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 06:57:06,838 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 06:57:06,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 06:57:06,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 06:57:06,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 06:57:06,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 06:57:06,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:06,845 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 06:57:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 06:57:06,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 06:57:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 06:57:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 06:57:06,859 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 06:57:06,859 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 06:57:06,859 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:57:06,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 06:57:06,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 06:57:06,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:06,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:06,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:57:06,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:57:06,865 INFO L793 eck$LassoCheckResult]: Stem: 12455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 06:57:06,867 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13246#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13244#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13242#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13240#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13238#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13236#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13234#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13191#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13192#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13229#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13227#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13225#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13223#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13221#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13220#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13218#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13216#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13214#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13212#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13210#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13207#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13205#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13203#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13201#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13199#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13197#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13195#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13193#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12853#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12854#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13153#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13151#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13149#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13147#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13145#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13143#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13141#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13139#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13137#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13135#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13133#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13131#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13129#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13127#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13125#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12851#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12852#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13433#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13431#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13429#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13427#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13425#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13423#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13421#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13419#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13417#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13415#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13413#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13411#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13409#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13407#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13405#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13403#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13401#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13399#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13397#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13395#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13393#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13391#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13389#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13387#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13385#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13383#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13381#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13379#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13377#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13375#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13373#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13371#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13369#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13367#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13365#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13363#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13361#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13359#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13357#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12352#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13354#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13352#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13350#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13348#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13346#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13344#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13342#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13340#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13338#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13335#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13333#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13331#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13329#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13327#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13325#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13323#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13321#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13319#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13317#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13315#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13313#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13311#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13310#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13308#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13306#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13303#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13301#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13299#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13297#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13295#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13293#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13291#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13289#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13287#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13285#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13283#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13281#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13279#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13277#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13275#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13273#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13271#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13269#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13267#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13265#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13263#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13261#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13259#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13257#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13255#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13253#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13251#L594-1 calculate_output_#res := -2; 13249#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 06:57:06,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 06:57:06,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 06:57:06,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:06,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 06:57:06,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:06,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:57:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:57:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:57:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 06:57:08,203 WARN L179 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 06:57:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 06:57:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:57:08,288 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 06:57:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:57:09,331 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 06:57:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:57:09,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 06:57:09,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 06:57:09,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 06:57:09,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 06:57:09,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 06:57:09,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 06:57:09,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:57:09,356 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 06:57:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 06:57:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 06:57:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 06:57:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 06:57:09,386 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 06:57:09,386 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 06:57:09,386 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:57:09,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 06:57:09,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 06:57:09,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:57:09,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:57:09,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:57:09,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:57:09,395 INFO L793 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16961#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16959#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16957#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16955#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15804#L597 [2018-11-10 06:57:09,395 INFO L795 eck$LassoCheckResult]: Loop: 15804#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 17060#L606-3 assume true; 17059#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17058#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17057#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 17056#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 17055#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 17054#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 17053#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15804#L597 [2018-11-10 06:57:09,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 06:57:09,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 06:57:09,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:09,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:57:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 06:57:09,413 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:57:09,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:57:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:57:09,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:57:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:57:09,558 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-10 06:57:09,689 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:57:09,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:57:09,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:57:09,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:57:09,690 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:57:09,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:09,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:57:09,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:57:09,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label42_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 06:57:09,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:57:09,690 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:57:09,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:57:09,913 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:57:09,914 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:09,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:09,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:09,922 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:09,922 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:09,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:09,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:09,966 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:09,966 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:09,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:09,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:09,973 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:09,973 INFO L446 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_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:09,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:09,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:09,998 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:09,999 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,024 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,024 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,069 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,069 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,077 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,077 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,119 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,119 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,145 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,146 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/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-10 06:57:10,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,152 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,152 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,197 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,197 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,222 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,223 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,230 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,230 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/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-10 06:57:10,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,255 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,255 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,299 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,299 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,303 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:57:10,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,595 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,596 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,621 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,621 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,642 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:57:10,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,863 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,863 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,905 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,905 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,912 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,912 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:57:10,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:57:10,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:57:10,937 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:57:10,937 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 06:57:10,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:57:10 BoogieIcfgContainer [2018-11-10 06:57:10,984 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:57:10,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:57:10,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:57:10,985 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:57:10,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:56:59" (3/4) ... [2018-11-10 06:57:10,989 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 06:57:11,031 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c5e7a5b2-bcad-4f30-ad10-338781c9d255/bin-2019/uautomizer/witness.graphml [2018-11-10 06:57:11,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:57:11,032 INFO L168 Benchmark]: Toolchain (without parser) took 12794.65 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 496.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -104.3 MB). Peak memory consumption was 391.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,033 INFO L168 Benchmark]: CDTParser took 0.17 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-10 06:57:11,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -236.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,034 INFO L168 Benchmark]: Boogie Preprocessor took 49.62 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,034 INFO L168 Benchmark]: RCFGBuilder took 994.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,035 INFO L168 Benchmark]: BuchiAutomizer took 11159.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -14.5 MB). Peak memory consumption was 527.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:57:11,035 INFO L168 Benchmark]: Witness Printer took 46.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:57:11,037 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.17 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 411.17 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -236.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.62 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 994.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11159.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -14.5 MB). Peak memory consumption was 527.4 MB. Max. memory is 11.5 GB. * Witness Printer took 46.95 ms. Allocated memory is still 1.5 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 6.7s. Construction of modules took 2.7s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 81ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cfe46c7=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f2b33f4=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cfe46c7=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f2b33f4=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cfe46c7=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f2b33f4=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...