./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_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_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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 e1aefec8ddab0c97dfdccb598d218efc3fd3f309 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-10-27 06:07:39,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:39,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:39,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:39,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:39,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:39,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:39,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:39,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:39,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:39,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:39,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:39,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:39,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:39,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:39,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:39,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:39,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:39,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:39,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:39,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:39,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:39,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:39,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:39,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:39,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:39,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:39,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:39,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:39,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:39,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:39,645 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:39,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:39,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:39,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:39,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:39,649 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:07:39,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:39,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:39,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:39,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:39,664 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:39,664 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:39,665 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:39,665 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:39,665 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:39,665 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:39,665 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:39,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:39,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:07:39,667 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:39,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:39,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:07:39,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:39,669 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:39,669 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:39,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:39,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:39,669 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:39,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:39,670 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:39,670 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:39,671 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:39,671 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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 -> e1aefec8ddab0c97dfdccb598d218efc3fd3f309 [2018-10-27 06:07:39,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:39,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:39,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:39,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:39,720 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:39,721 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-10-27 06:07:39,779 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/data/038ffe043/d0d1febc2a014ea9b337ec0efd9c0edb/FLAG391288260 [2018-10-27 06:07:40,282 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:40,283 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-10-27 06:07:40,294 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/data/038ffe043/d0d1febc2a014ea9b337ec0efd9c0edb/FLAG391288260 [2018-10-27 06:07:40,308 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/data/038ffe043/d0d1febc2a014ea9b337ec0efd9c0edb [2018-10-27 06:07:40,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:40,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:40,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:40,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:40,319 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:40,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:40,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dba4841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40, skipping insertion in model container [2018-10-27 06:07:40,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:40,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:40,384 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:40,739 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:40,744 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:40,876 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:40,892 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:40,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40 WrapperNode [2018-10-27 06:07:40,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:40,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:40,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:40,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:40,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:40,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:41,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:41,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:41,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:41,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... [2018-10-27 06:07:41,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:41,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:41,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:41,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:41,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:41,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:41,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:44,288 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:44,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:44 BoogieIcfgContainer [2018-10-27 06:07:44,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:44,289 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:44,289 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:44,294 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:44,295 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:44,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:40" (1/3) ... [2018-10-27 06:07:44,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fa3c592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:44, skipping insertion in model container [2018-10-27 06:07:44,296 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:44,296 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:40" (2/3) ... [2018-10-27 06:07:44,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fa3c592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:44, skipping insertion in model container [2018-10-27 06:07:44,297 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:44,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:44" (3/3) ... [2018-10-27 06:07:44,301 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label07_true-unreach-call_false-termination.c [2018-10-27 06:07:44,364 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:44,365 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:44,365 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:44,365 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:44,365 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:44,366 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:44,367 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:44,367 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:44,367 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:44,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:07:44,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:07:44,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:44,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:44,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:44,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:44,463 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:44,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:07:44,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:07:44,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:44,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:44,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:44,482 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:44,493 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-10-27 06:07:44,494 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-10-27 06:07:44,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:44,502 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:07:44,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:44,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:44,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:44,628 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-10-27 06:07:44,629 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:44,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-10-27 06:07:44,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:44,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:45,191 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-10-27 06:07:45,256 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:45,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:45,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:45,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:45,258 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:07:45,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:45,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:45,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:45,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:07:45,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:45,259 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:45,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,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-10-27 06:07:45,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:45,649 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:07:45,819 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:45,820 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:45,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:45,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:45,847 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:45,847 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:45,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:45,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:45,866 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:45,867 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:45,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:45,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:45,935 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:45,935 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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) [2018-10-27 06:07:45,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:45,942 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:45,953 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:45,953 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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) [2018-10-27 06:07:46,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:46,016 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:46,059 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:46,059 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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) [2018-10-27 06:07:46,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:46,072 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:46,087 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:46,087 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:46,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:46,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:46,123 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:46,123 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:46,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:46,145 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:46,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:46,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:46,210 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:07:46,212 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:46,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:46,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:46,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:46,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:46,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:46,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:46,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:46,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:07:46,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:46,213 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:46,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:46,673 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:07:47,177 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:07:47,179 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:47,184 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:47,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-10-27 06:07:47,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,216 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:47,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:47,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,282 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:47,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,291 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:07:47,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,293 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,317 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,322 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:47,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,348 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,357 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,357 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,365 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,373 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:47,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,389 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:07:47,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,392 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,417 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,420 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:47,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,444 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,461 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,469 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,470 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,474 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,474 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:47,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,494 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:07:47,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,496 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,497 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,521 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,522 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,532 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,536 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:07:47,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,572 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,578 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,581 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,585 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,585 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,593 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,594 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:47,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,599 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,600 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:47,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,609 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:07:47,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-10-27 06:07:47,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,612 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,632 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,633 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,640 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,641 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,641 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,647 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:47,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,699 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,700 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,712 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,719 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,720 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,721 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,725 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:47,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:47,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,732 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:47,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:47,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,741 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:07:47,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-10-27 06:07:47,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,742 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,746 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,763 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,772 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,772 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,778 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:47,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,811 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,823 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,828 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,839 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:47,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:47,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,847 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:47,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:47,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,859 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:07:47,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,861 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,867 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,880 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,891 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:47,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,900 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:07:47,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,944 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,950 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,962 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,975 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,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-10-27 06:07:47,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,986 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:47,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,988 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:47,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:47,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:47,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:47,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:47,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:47,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:47,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:47,996 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:47,996 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:47,998 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:47,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,016 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:07:48,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,018 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,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-10-27 06:07:48,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,048 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:48,048 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,049 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:48,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,076 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,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-10-27 06:07:48,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,088 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,105 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,105 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:48,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,107 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:48,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,109 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:48,109 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:48,117 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:48,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,126 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:07:48,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,128 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,171 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,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-10-27 06:07:48,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,180 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,180 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:48,180 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,187 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:07:48,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,296 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,297 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,316 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,316 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,328 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,329 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,342 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:48,343 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:48,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:48,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:48,347 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:48,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:48,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:48,347 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:48,347 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:48,349 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:48,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:48,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:48,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:48,380 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-10-27 06:07:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:49,690 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-10-27 06:07:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:49,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-10-27 06:07:49,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-10-27 06:07:49,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-10-27 06:07:49,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-10-27 06:07:49,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-10-27 06:07:49,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-10-27 06:07:49,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:49,708 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-10-27 06:07:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-10-27 06:07:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-27 06:07:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 06:07:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-10-27 06:07:49,755 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:07:49,755 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:07:49,755 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:49,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-10-27 06:07:49,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-10-27 06:07:49,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:49,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:49,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:49,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:49,760 INFO L793 eck$LassoCheckResult]: Stem: 749#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; 632#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; 633#L606-3 [2018-10-27 06:07:49,761 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#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; 734#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); 874#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 757#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); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#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); 634#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; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-10-27 06:07:49,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:07:49,761 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:49,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-10-27 06:07:49,772 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:49,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:49,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:49,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:49,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-10-27 06:07:49,792 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:49,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:49,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:49,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:49,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:50,063 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-10-27 06:07:50,084 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:50,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:50,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:50,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:50,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:07:50,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:50,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:50,085 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:50,085 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:07:50,085 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:50,085 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:50,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,363 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:50,363 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,393 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:50,393 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,401 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:50,402 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,423 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:50,423 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,449 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:50,449 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,492 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:50,492 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:50,498 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:07:50,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:50,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:50,559 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:07:50,560 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:50,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:50,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:50,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:50,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:50,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:50,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:50,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:50,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:07:50,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:50,561 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:50,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:50,961 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:50,961 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:50,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-10-27 06:07:50,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:50,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:50,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:50,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:50,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:50,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:50,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:50,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:50,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,977 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:50,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:50,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:50,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,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-10-27 06:07:50,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:50,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:50,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:50,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,981 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:50,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:50,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:50,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-10-27 06:07:50,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:50,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:50,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:50,984 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:50,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:50,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:50,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:50,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:51,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:51,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,009 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:07:51,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-10-27 06:07:51,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,010 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,012 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,012 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,014 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,014 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,018 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,020 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,020 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,036 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,036 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,052 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:07:51,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-10-27 06:07:51,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,055 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,058 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,058 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,058 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,062 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,074 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,076 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,077 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,081 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,081 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,081 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,098 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:07:51,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,099 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,100 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,105 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,114 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,115 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,117 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,118 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,119 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,121 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,130 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,134 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,134 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,135 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:51,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,149 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,149 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:07:51,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,163 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,167 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,171 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,171 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,186 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,188 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,188 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,191 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,191 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,197 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,197 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,230 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,230 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:51,231 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:51,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,235 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:07:51,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,236 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,237 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,241 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,241 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,254 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,258 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,260 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,262 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,262 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,264 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,280 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,280 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,281 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,299 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,299 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,299 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,301 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,322 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:51,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,322 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,323 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,335 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:07:51,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,336 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,336 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,337 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,349 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,350 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,352 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,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-10-27 06:07:51,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,371 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,371 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,371 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,378 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,380 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,381 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,381 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,397 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,398 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,412 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,414 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,434 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,438 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,438 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,444 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:51,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,536 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,539 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:51,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:51,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,558 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:07:51,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,558 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,577 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,578 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,578 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,580 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,581 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,581 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,595 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,600 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,617 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,617 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,617 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:51,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:51,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:51,640 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:51,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,646 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:07:51,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,647 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,647 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,659 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,660 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,681 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,681 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,682 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:51,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,684 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,685 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,689 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,705 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,706 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:51,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,724 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:51,724 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,726 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:51,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:51,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:51,774 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:51,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:51,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:51,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:51,774 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:51,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:51,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:51,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:51,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:51,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:51,813 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-10-27 06:07:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:53,073 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-10-27 06:07:53,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:53,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-10-27 06:07:53,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:07:53,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:07:53,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-10-27 06:07:53,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-10-27 06:07:53,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-10-27 06:07:53,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:53,090 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-10-27 06:07:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-10-27 06:07:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-27 06:07:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:07:53,117 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:53,117 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:53,117 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:53,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-10-27 06:07:53,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:07:53,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:53,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:53,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:53,125 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-10-27 06:07:53,125 INFO L793 eck$LassoCheckResult]: Stem: 1796#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; 1673#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; 1674#L606-3 [2018-10-27 06:07:53,127 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1904#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1775#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; 1776#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; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2184#L606-3 assume true; 2182#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2180#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; 2178#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); 2176#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2174#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); 2172#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2170#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); 2168#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2166#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)); 2164#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); 2162#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); 2160#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); 2158#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2156#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); 2154#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2152#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2150#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2147#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); 2145#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); 2143#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2141#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); 2139#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2137#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2135#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); 2133#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2131#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); 2129#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); 2127#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2125#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2123#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2121#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2119#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); 2117#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2115#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2113#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2111#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); 2109#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2107#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2105#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); 2103#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2101#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); 2099#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); 2097#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2095#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); 2093#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2091#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2089#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)); 2088#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); 2086#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; 1782#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-10-27 06:07:53,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:07:53,128 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:53,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:53,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:53,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-10-27 06:07:53,147 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:53,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:53,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:53,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:07:53,446 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:07:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:07:53,448 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-10-27 06:07:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:54,483 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-10-27 06:07:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:54,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:54,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-10-27 06:07:54,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-10-27 06:07:54,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-10-27 06:07:54,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-10-27 06:07:54,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:54,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:54,505 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-10-27 06:07:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-10-27 06:07:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-27 06:07:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-10-27 06:07:54,534 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-10-27 06:07:54,534 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-10-27 06:07:54,534 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:54,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-10-27 06:07:54,543 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-10-27 06:07:54,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:54,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:54,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:54,545 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-10-27 06:07:54,545 INFO L793 eck$LassoCheckResult]: Stem: 3691#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-10-27 06:07:54,545 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4387#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4386#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; 4385#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); 4383#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4381#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); 4379#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4378#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); 4350#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; 3747#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4334#L606-3 assume true; 4332#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4330#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; 4328#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; 3815#L606-3 assume true; 3816#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4182#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; 4181#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); 4179#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4177#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); 4175#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4173#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); 4171#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4169#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)); 4167#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); 4165#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); 4163#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); 4161#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4159#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); 4157#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4155#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4153#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4151#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); 4149#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); 4147#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4145#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); 4143#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4141#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4139#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); 4137#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4135#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); 4133#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); 4131#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4129#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4127#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4125#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4123#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); 4121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4115#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); 4113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4109#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); 4107#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4105#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); 4103#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); 4101#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4099#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); 4097#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4095#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4093#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)); 4091#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); 4088#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; 4089#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-10-27 06:07:54,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:07:54,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:54,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:54,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:54,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-10-27 06:07:54,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:54,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:07:54,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:54,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:54,690 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:54,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:54,690 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-10-27 06:07:56,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:56,334 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-10-27 06:07:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:56,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-10-27 06:07:56,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-10-27 06:07:56,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-10-27 06:07:56,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-10-27 06:07:56,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-10-27 06:07:56,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-10-27 06:07:56,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:56,357 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-10-27 06:07:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-10-27 06:07:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-10-27 06:07:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-10-27 06:07:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-10-27 06:07:56,384 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-10-27 06:07:56,384 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-10-27 06:07:56,384 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:56,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-10-27 06:07:56,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:56,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:56,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:56,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:56,395 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-10-27 06:07:56,395 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-10-27 06:07:56,395 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7340#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7338#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; 7336#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); 7334#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7332#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); 7330#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7328#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); 7326#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7324#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)); 7322#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); 7320#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); 7318#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); 7316#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7314#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); 7312#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7310#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7308#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6967#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; 6551#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6958#L606-3 assume true; 6956#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6954#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; 6952#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; 6539#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6959#L606-3 assume true; 6957#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6955#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; 6953#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); 6951#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6949#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); 6947#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6945#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); 6943#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6941#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)); 6939#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); 6937#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); 6935#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); 6933#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6931#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); 6929#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6927#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6925#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6923#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); 6921#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); 6919#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6917#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); 6915#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6913#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6911#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); 6909#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6907#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); 6905#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); 6903#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6901#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6899#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6897#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6895#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); 6893#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6891#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6889#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6887#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); 6885#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6883#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6881#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); 6879#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6877#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); 6875#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); 6873#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6871#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); 6869#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6867#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6865#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)); 6862#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); 6859#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; 6860#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-10-27 06:07:56,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:07:56,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:56,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:56,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-10-27 06:07:56,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:56,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:56,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:56,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:56,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:07:56,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:56,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:56,497 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:56,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:56,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:56,498 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-10-27 06:07:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:57,046 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-10-27 06:07:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:57,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-10-27 06:07:57,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:57,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-10-27 06:07:57,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-10-27 06:07:57,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-10-27 06:07:57,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-10-27 06:07:57,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:57,070 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-10-27 06:07:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-10-27 06:07:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-10-27 06:07:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-27 06:07:57,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-10-27 06:07:57,096 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-10-27 06:07:57,096 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-10-27 06:07:57,096 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:57,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-10-27 06:07:57,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:57,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:57,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:57,108 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:57,108 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-10-27 06:07:57,108 INFO L793 eck$LassoCheckResult]: Stem: 9450#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-10-27 06:07:57,109 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10073#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10071#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; 10069#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); 10067#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10065#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); 10064#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10063#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); 10061#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10059#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)); 10057#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); 10055#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); 10053#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); 10051#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10049#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); 10047#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10045#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10043#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9905#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); 9906#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); 10666#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10662#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); 10658#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10653#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10648#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); 10643#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10638#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); 10633#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); 10629#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9796#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; 9687#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9789#L606-3 assume true; 9787#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9785#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; 9783#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); 9781#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9779#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); 9777#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9775#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); 9773#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9771#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)); 9769#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); 9767#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); 9765#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); 9763#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9761#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); 9759#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9757#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9755#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9753#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); 9751#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); 9749#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9747#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); 9745#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9743#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9741#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); 9739#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9737#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); 9735#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); 9732#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9730#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9728#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9726#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9724#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); 9722#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9720#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9718#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9716#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); 9714#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9712#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9710#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); 9708#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9706#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); 9704#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); 9702#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9700#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); 9698#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9696#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9694#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)); 9692#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); 9689#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; 9690#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-10-27 06:07:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:07:57,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:57,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,138 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-10-27 06:07:57,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:57,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:57,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:57,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:57,262 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:57,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:57,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:57,262 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-10-27 06:07:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:57,520 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-10-27 06:07:57,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:57,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-10-27 06:07:57,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:07:57,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-10-27 06:07:57,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-10-27 06:07:57,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-10-27 06:07:57,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-10-27 06:07:57,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:57,541 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-10-27 06:07:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-10-27 06:07:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-10-27 06:07:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-27 06:07:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-10-27 06:07:57,565 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-10-27 06:07:57,565 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-10-27 06:07:57,565 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:57,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-10-27 06:07:57,575 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:07:57,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:57,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:57,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:57,576 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-10-27 06:07:57,576 INFO L793 eck$LassoCheckResult]: Stem: 12454#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-10-27 06:07:57,577 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13733#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13731#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; 13729#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); 13079#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13080#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); 13603#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13602#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); 13600#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13598#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)); 13596#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); 13594#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); 13593#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); 13592#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13590#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); 13588#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13586#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13584#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13582#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); 13580#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); 13578#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13576#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); 13574#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13573#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13572#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); 13570#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13568#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); 13566#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); 13564#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12848#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12359#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 12325#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 12326#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); 12409#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 12410#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12438#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 12368#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); 12369#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 12439#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 12372#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); 12373#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 12584#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); 13571#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); 13569#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13567#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); 13565#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12846#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12847#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)); 13559#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); 13557#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); 13555#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13553#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); 13457#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13458#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13724#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); 13723#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); 13721#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13719#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13717#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); 13715#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13714#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); 13713#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); 12558#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 12535#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)); 12536#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12511#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); 12398#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12399#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)); 12508#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12390#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12391#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12388#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)); 12389#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12510#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)); 12419#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 12420#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 12605#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13629#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); 13628#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13626#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13624#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13622#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13620#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13618#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13616#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13614#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13612#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12554#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12386#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12387#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12355#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12356#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12501#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12502#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12464#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12465#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12549#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13816#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13815#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13702#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13700#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13697#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13694#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13692#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13690#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13688#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13687#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13686#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13685#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13683#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13681#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13679#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12486#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13787#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13785#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13783#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13781#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13779#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13777#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13775#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13773#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13771#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13769#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13767#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13765#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13763#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13761#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13759#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13757#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13756#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13754#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13752#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13750#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13748#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13746#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13744#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13742#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13740#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13738#L594-1 calculate_output_#res := -2; 13736#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-10-27 06:07:57,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:07:57,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:57,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:57,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:57,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-10-27 06:07:57,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:57,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-10-27 06:07:57,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:57,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:57,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:58,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:58,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:07:59,132 WARN L179 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-10-27 06:07:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:59,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:59,223 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-10-27 06:07:59,693 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-27 06:08:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:00,398 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-10-27 06:08:00,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:08:00,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-10-27 06:08:00,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-10-27 06:08:00,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-10-27 06:08:00,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-10-27 06:08:00,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-10-27 06:08:00,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-10-27 06:08:00,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:00,417 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-10-27 06:08:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-10-27 06:08:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-10-27 06:08:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-10-27 06:08:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-10-27 06:08:00,444 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-10-27 06:08:00,444 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-10-27 06:08:00,444 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:08:00,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-10-27 06:08:00,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-10-27 06:08:00,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:00,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:00,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,450 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:00,457 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; 16805#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16803#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; 16801#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); 16273#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; 15808#L597 [2018-10-27 06:08:00,458 INFO L795 eck$LassoCheckResult]: Loop: 15808#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16248#L606-3 assume true; 16246#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16244#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; 16242#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); 16240#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16238#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); 16236#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16234#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; 15808#L597 [2018-10-27 06:08:00,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-10-27 06:08:00,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-10-27 06:08:00,474 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-10-27 06:08:00,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:00,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:00,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:00,829 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-27 06:08:00,960 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:00,960 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:00,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:00,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:00,961 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:08:00,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:00,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:00,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:00,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-10-27 06:08:00,961 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:00,961 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:00,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:00,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:01,235 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:01,235 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,242 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,242 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,286 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,286 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,298 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,298 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,323 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,324 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,351 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,351 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,373 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,393 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,393 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,405 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,405 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,445 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,445 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,471 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,471 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,478 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,478 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,520 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,520 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,545 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,545 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,567 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,567 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,596 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,596 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,634 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,635 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,640 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:01,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,899 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,900 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:01,923 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:01,923 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:01,943 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:01,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:08:01,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:02,130 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:02,131 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:02,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:02,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:02,168 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:02,168 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:02,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:02,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:02,175 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:02,175 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_45d286cd-f87c-4477-a64a-eeede7bef3c4/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-10-27 06:08:02,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:08:02,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:08:02,203 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:08:02,203 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-10-27 06:08:02,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:08:02 BoogieIcfgContainer [2018-10-27 06:08:02,252 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:08:02,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:08:02,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:08:02,253 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:08:02,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:44" (3/4) ... [2018-10-27 06:08:02,261 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:08:02,328 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_45d286cd-f87c-4477-a64a-eeede7bef3c4/bin-2019/uautomizer/witness.graphml [2018-10-27 06:08:02,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:08:02,329 INFO L168 Benchmark]: Toolchain (without parser) took 22016.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -53.2 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:02,330 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:02,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:02,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 925.4 MB in the beginning and 1.2 GB in the end (delta: -236.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:02,331 INFO L168 Benchmark]: Boogie Preprocessor took 53.22 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:02,332 INFO L168 Benchmark]: RCFGBuilder took 3160.94 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-10-27 06:08:02,332 INFO L168 Benchmark]: BuchiAutomizer took 17963.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 35.1 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:08:02,332 INFO L168 Benchmark]: Witness Printer took 76.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:08:02,335 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 925.4 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 179.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 925.4 MB in the beginning and 1.2 GB in the end (delta: -236.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.22 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3160.94 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 17963.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 35.1 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. * Witness Printer took 76.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 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 17.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 10.0s. Construction of modules took 5.9s. Büchi inclusion checks took 1.2s. 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: 1470 SDtfs, 3079 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s 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: 116ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - 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@e98d6b7=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e2ab4af=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@e98d6b7=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e2ab4af=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@e98d6b7=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@5e2ab4af=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...