./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/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 cae8686038ca87cfc982771df117a4c5585b00bb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 11:39:19,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:39:19,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:39:19,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:39:19,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:39:19,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:39:19,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:39:19,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:39:19,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:39:19,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:39:19,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:39:19,668 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:39:19,669 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:39:19,670 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:39:19,671 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:39:19,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:39:19,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:39:19,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:39:19,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:39:19,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:39:19,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:39:19,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:39:19,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:39:19,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:39:19,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:39:19,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:39:19,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:39:19,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:39:19,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:39:19,685 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:39:19,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:39:19,686 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:39:19,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:39:19,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:39:19,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:39:19,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:39:19,688 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:39:19,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:39:19,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:39:19,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:39:19,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:39:19,702 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:39:19,702 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:39:19,703 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:39:19,706 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:39:19,706 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:39:19,706 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:39:19,706 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:39:19,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:39:19,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:39:19,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:39:19,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:39:19,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:39:19,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:39:19,709 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:39:19,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:39:19,709 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:39:19,710 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:39:19,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:39:19,710 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_73c3578b-172c-409d-8869-782f1225894c/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 -> cae8686038ca87cfc982771df117a4c5585b00bb [2018-11-18 11:39:19,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:39:19,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:39:19,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:39:19,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:39:19,751 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:39:19,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-11-18 11:39:19,806 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/data/1b8451648/daa8d138736649d79dfc6732d8c14e72/FLAGb16bbdf36 [2018-11-18 11:39:20,184 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:39:20,185 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/sv-benchmarks/c/eca-rers2012/Problem02_label53_true-unreach-call_false-termination.c [2018-11-18 11:39:20,194 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/data/1b8451648/daa8d138736649d79dfc6732d8c14e72/FLAGb16bbdf36 [2018-11-18 11:39:20,573 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/data/1b8451648/daa8d138736649d79dfc6732d8c14e72 [2018-11-18 11:39:20,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:39:20,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:39:20,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:39:20,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:39:20,580 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:39:20,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:39:20" (1/1) ... [2018-11-18 11:39:20,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f427c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:20, skipping insertion in model container [2018-11-18 11:39:20,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:39:20" (1/1) ... [2018-11-18 11:39:20,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:39:20,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:39:20,913 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:39:20,917 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:39:20,987 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:39:21,003 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:39:21,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21 WrapperNode [2018-11-18 11:39:21,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:39:21,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:39:21,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:39:21,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:39:21,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:39:21,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:39:21,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:39:21,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:39:21,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... [2018-11-18 11:39:21,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:39:21,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:39:21,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:39:21,177 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:39:21,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:39:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:39:21,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:39:22,142 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:39:22,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:22 BoogieIcfgContainer [2018-11-18 11:39:22,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:39:22,143 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:39:22,144 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:39:22,147 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:39:22,148 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:39:22,148 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:39:20" (1/3) ... [2018-11-18 11:39:22,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4543908b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:39:22, skipping insertion in model container [2018-11-18 11:39:22,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:39:22,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:39:21" (2/3) ... [2018-11-18 11:39:22,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4543908b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:39:22, skipping insertion in model container [2018-11-18 11:39:22,151 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:39:22,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:22" (3/3) ... [2018-11-18 11:39:22,153 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label53_true-unreach-call_false-termination.c [2018-11-18 11:39:22,192 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:39:22,192 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:39:22,193 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:39:22,193 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:39:22,193 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:39:22,193 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:39:22,193 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:39:22,193 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:39:22,193 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:39:22,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:39:22,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:39:22,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:22,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:22,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:22,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:39:22,246 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:39:22,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:39:22,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:39:22,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:22,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:22,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:22,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:39:22,259 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 11:39:22,260 INFO L796 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 !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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 ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 11:39:22,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 11:39:22,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:22,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:22,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 11:39:22,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:22,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:22,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:22,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:22,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 11:39:22,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:22,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:22,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:22,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:39:22,577 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:39:22,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:39:22,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:39:22,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:39:22,578 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:39:22,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:22,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:39:22,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:39:22,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label53_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:39:22,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:39:22,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:39:22,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,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-11-18 11:39:22,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:22,870 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:39:22,871 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:22,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:22,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:22,889 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:22,889 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:22,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:22,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:22,926 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:22,927 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:22,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:22,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:22,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:22,963 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:22,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:22,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:22,994 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:22,994 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:23,023 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:23,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:23,026 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:23,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:23,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:23,050 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:23,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:23,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:23,102 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:23,143 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:39:23,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:23,206 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:39:23,208 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:39:23,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:39:23,209 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:39:23,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:39:23,209 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:39:23,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:23,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:39:23,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:39:23,210 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label53_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:39:23,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:39:23,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:39:23,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,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-11-18 11:39:23,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:23,620 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:39:23,625 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:39:23,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,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-11-18 11:39:23,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,648 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:23,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:23,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,684 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:23,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:23,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,690 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:39:23,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,703 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,703 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,707 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,707 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,709 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:39:23,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,727 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,728 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,738 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:23,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:23,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,751 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:39:23,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,754 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,767 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,770 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:23,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,786 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:23,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,806 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:23,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,811 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:39:23,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,812 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,813 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,821 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,825 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,828 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:39:23,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,844 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,849 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,850 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,853 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,853 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,857 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,857 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:23,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:23,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:23,859 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:23,860 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:23,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,865 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:39:23,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,866 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,866 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,868 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,883 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,884 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,884 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,888 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,889 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,892 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:39:23,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,931 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,935 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,936 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,940 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,941 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:23,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,943 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:23,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:23,943 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:23,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:23,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,951 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:39:23,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,952 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,952 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:23,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,970 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:23,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:23,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:23,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:23,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:23,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:23,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:23,977 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:23,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:23,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:23,977 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:23,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:23,981 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:23,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,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-11-18 11:39:24,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,019 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:24,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,027 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:24,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,033 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:24,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,033 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,034 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,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-11-18 11:39:24,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:24,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,043 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:24,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,043 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:24,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,045 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:24,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,054 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:39:24,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,056 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,056 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,059 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,073 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,074 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,075 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,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-11-18 11:39:24,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,081 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,082 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:24,082 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,087 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:39:24,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,127 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,138 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,139 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,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-11-18 11:39:24,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:24,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,155 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,155 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:24,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:24,157 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:24,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,168 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:39:24,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,169 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,169 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,170 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,171 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,186 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,186 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:24,187 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,188 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:24,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,216 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,220 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:24,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:24,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,223 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:24,223 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:24,223 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:24,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,229 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:39:24,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,231 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,263 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,268 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:39:24,269 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,271 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 11:39:24,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,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-11-18 11:39:24,350 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,350 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,350 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,364 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,368 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,369 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,374 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:24,374 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:24,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:24,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:24,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:24,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:24,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:24,380 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:24,381 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:24,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:24,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:24,411 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 11:39:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:25,134 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 11:39:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:25,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 11:39:25,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 11:39:25,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 11:39:25,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 11:39:25,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 11:39:25,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 11:39:25,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:25,150 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 11:39:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 11:39:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 11:39:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 11:39:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 11:39:25,181 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:39:25,182 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:39:25,182 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:39:25,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 11:39:25,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 11:39:25,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:25,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:25,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:25,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:25,186 INFO L794 eck$LassoCheckResult]: Stem: 752#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-11-18 11:39:25,186 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 978#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 977#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 886#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 887#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 761#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 696#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 697#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 853#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 634#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~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-11-18 11:39:25,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 11:39:25,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:25,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:25,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:25,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:25,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 11:39:25,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:39:25,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:25,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 11:39:25,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:25,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:25,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:39:25,337 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:39:25,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:39:25,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:39:25,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:39:25,337 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:39:25,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:39:25,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:39:25,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label53_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:39:25,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:39:25,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:39:25,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,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-11-18 11:39:25,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,459 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:39:25,459 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:25,467 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:25,489 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:25,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:25,531 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:25,552 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:25,573 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:39:25,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:25,622 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:39:25,623 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:39:25,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:39:25,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:39:25,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:39:25,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:39:25,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:25,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:39:25,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:39:25,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label53_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:39:25,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:39:25,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:39:25,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,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-11-18 11:39:25,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:25,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:39:25,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:39:25,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:25,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:25,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,758 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:25,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:25,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,766 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:39:25,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:39:25,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,771 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:39:25,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,774 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,775 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,779 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,781 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,791 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,792 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,794 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:39:25,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,798 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,801 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,808 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,811 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,820 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:39:25,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,822 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,824 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,825 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,828 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,830 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,830 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,832 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,835 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,835 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,840 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:39:25,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,846 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,846 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,850 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:39:25,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,851 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,851 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,851 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,854 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,855 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,859 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,859 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,861 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,862 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,862 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,863 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,864 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,864 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,867 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,867 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,867 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,872 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:25,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,881 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:25,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,881 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:39:25,882 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:39:25,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,886 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:39:25,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,887 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,887 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,891 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,893 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,897 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,898 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,901 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,903 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,907 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,908 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,909 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,915 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,916 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:25,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,930 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:39:25,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:25,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:25,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,938 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:39:25,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,947 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,957 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,957 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,959 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,962 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:25,965 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:25,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,972 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,975 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:25,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:25,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:25,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:25,986 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:25,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:25,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:25,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:25,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:25,990 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:39:25,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,013 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,014 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:39:26,016 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:39:26,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,027 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:39:26,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,028 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:26,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,033 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:26,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,038 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,038 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,039 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:26,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,041 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,042 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:26,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,045 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,045 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:26,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,093 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,093 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,093 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,094 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:26,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,108 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:39:26,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,116 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:39:26,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,117 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:39:26,118 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:39:26,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,124 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:39:26,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,126 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:26,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,130 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,130 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:26,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,140 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,140 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,141 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:26,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,144 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:26,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,148 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:26,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,152 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,153 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,154 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:26,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:39:26,165 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,166 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:39:26,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:39:26,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:39:26,191 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:39:26,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:39:26,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:39:26,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:39:26,192 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:39:26,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:39:26,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:39:26,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:39:26,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:26,216 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 11:39:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:26,700 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-18 11:39:26,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:26,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-18 11:39:26,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:39:26,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 11:39:26,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 11:39:26,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 11:39:26,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-18 11:39:26,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:26,712 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 11:39:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-18 11:39:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 11:39:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 11:39:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 11:39:26,736 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 11:39:26,736 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 11:39:26,736 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:39:26,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-18 11:39:26,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:39:26,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:26,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:26,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:26,746 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:26,746 INFO L794 eck$LassoCheckResult]: Stem: 1794#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 11:39:26,747 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1906#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1774#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1932#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2202#L606-3 assume true; 2200#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2198#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 2196#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2194#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2192#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 2190#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2188#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 2185#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2183#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 2181#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 2179#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 2177#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 2175#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2173#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2171#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2169#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2167#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2165#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 2163#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 2161#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2159#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 2157#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2142#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2143#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1768#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1769#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1770#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1771#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2127#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2126#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2124#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2122#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 2120#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2118#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2116#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2114#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 2112#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2110#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2107#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 2108#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2209#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 2210#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1933#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1837#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1838#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1889#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1761#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1762#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1763#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1780#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 11:39:26,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:26,748 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 11:39:26,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:26,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:26,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:26,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:26,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 11:39:26,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:26,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:26,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:26,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:39:26,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:26,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:26,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:39:26,812 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:39:26,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:39:26,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:39:26,813 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-18 11:39:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:27,514 INFO L93 Difference]: Finished difference Result 1228 states and 1702 transitions. [2018-11-18 11:39:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:39:27,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1702 transitions. [2018-11-18 11:39:27,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 11:39:27,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1702 transitions. [2018-11-18 11:39:27,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 11:39:27,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 11:39:27,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1702 transitions. [2018-11-18 11:39:27,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:27,531 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1702 transitions. [2018-11-18 11:39:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1702 transitions. [2018-11-18 11:39:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 11:39:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 11:39:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1696 transitions. [2018-11-18 11:39:27,552 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1696 transitions. [2018-11-18 11:39:27,552 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1696 transitions. [2018-11-18 11:39:27,552 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:39:27,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1696 transitions. [2018-11-18 11:39:27,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 11:39:27,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:27,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:27,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:27,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:27,560 INFO L794 eck$LassoCheckResult]: Stem: 3692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 11:39:27,561 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3820#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3821#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4749#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4748#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3701#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3632#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3633#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3833#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3753#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4478#L606-3 assume true; 4476#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4474#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4472#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3713#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4548#L606-3 assume true; 4547#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4546#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 4545#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4544#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4490#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4491#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4543#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4542#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4541#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 4540#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 4539#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 4538#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 4536#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4534#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4532#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4531#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4322#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4323#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 4466#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 4464#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4462#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 4460#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4225#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4226#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 4530#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4529#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 4527#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 4524#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4525#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4492#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4326#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4327#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 4497#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4499#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4550#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4549#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 4487#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4488#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4537#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 4535#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4533#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 4494#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 4495#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4570#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 4568#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4566#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4564#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 4563#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 4562#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3716#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 11:39:27,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 11:39:27,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:27,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:27,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 11:39:27,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:27,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:27,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:39:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:39:27,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:27,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:27,603 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:39:27,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:27,604 INFO L87 Difference]: Start difference. First operand 1225 states and 1696 transitions. cyclomatic complexity: 473 Second operand 3 states. [2018-11-18 11:39:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:28,149 INFO L93 Difference]: Finished difference Result 1509 states and 2005 transitions. [2018-11-18 11:39:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:28,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2005 transitions. [2018-11-18 11:39:28,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 11:39:28,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2005 transitions. [2018-11-18 11:39:28,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 11:39:28,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 11:39:28,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2005 transitions. [2018-11-18 11:39:28,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:28,169 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2005 transitions. [2018-11-18 11:39:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2005 transitions. [2018-11-18 11:39:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 11:39:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 11:39:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2003 transitions. [2018-11-18 11:39:28,191 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2003 transitions. [2018-11-18 11:39:28,191 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2003 transitions. [2018-11-18 11:39:28,191 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:39:28,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2003 transitions. [2018-11-18 11:39:28,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:39:28,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:28,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:28,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:28,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:28,200 INFO L794 eck$LassoCheckResult]: Stem: 6429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 11:39:28,200 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7298#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7297#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 7295#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7293#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7291#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7289#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7287#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7285#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7283#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7281#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7279#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7277#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7275#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7273#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7271#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7269#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7267#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7265#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7449#L606-3 assume true; 7446#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7443#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 7441#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6803#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6956#L606-3 assume true; 6954#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6952#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 6950#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6948#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6946#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6944#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6942#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6940#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6938#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6936#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6934#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6932#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6930#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6928#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6926#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6924#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6922#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6920#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6918#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6916#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6914#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6912#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6910#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6908#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6906#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6904#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6902#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6900#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6898#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6896#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6892#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6890#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6888#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6886#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6884#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6882#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6880#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6878#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6876#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6874#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6870#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6868#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6866#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6864#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6862#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6860#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6858#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6855#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6856#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 11:39:28,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 11:39:28,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:28,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:28,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:28,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:28,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 11:39:28,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:39:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 11:39:28,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:28,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:28,256 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:39:28,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:28,256 INFO L87 Difference]: Start difference. First operand 1508 states and 2003 transitions. cyclomatic complexity: 497 Second operand 3 states. [2018-11-18 11:39:28,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:28,717 INFO L93 Difference]: Finished difference Result 1507 states and 1823 transitions. [2018-11-18 11:39:28,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:28,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1823 transitions. [2018-11-18 11:39:28,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:39:28,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-18 11:39:28,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 11:39:28,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 11:39:28,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1823 transitions. [2018-11-18 11:39:28,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:28,738 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 11:39:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1823 transitions. [2018-11-18 11:39:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 11:39:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 11:39:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-11-18 11:39:28,760 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 11:39:28,760 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-11-18 11:39:28,760 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:39:28,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1823 transitions. [2018-11-18 11:39:28,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:39:28,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:28,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:28,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:28,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:28,768 INFO L794 eck$LassoCheckResult]: Stem: 9453#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 11:39:28,768 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10688#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10685#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 9599#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9600#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10193#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10367#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10366#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10364#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10362#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10360#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10358#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10356#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10354#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10352#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10350#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10348#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10346#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10334#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 10335#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9399#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9400#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9620#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10613#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10607#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10601#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10596#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10592#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 10584#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9784#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9778#L606-3 assume true; 9776#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9774#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 9772#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9770#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9768#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9766#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9764#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9762#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9760#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9758#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9756#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9754#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9752#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9750#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9746#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9744#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9742#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9740#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9738#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9736#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9734#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9732#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9730#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 9728#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9726#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 9724#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 9721#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9719#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9717#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9715#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9713#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 9711#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9709#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9707#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9705#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 9703#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9701#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9699#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 9697#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9695#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 9693#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 9691#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9689#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 9687#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9685#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9683#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 9681#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 9679#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9477#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 11:39:28,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 11:39:28,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:28,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:28,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 11:39:28,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:28,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:28,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:39:28,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:39:28,833 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:39:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:39:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:39:28,834 INFO L87 Difference]: Start difference. First operand 1507 states and 1823 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-11-18 11:39:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:29,103 INFO L93 Difference]: Finished difference Result 1496 states and 1779 transitions. [2018-11-18 11:39:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:39:29,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1779 transitions. [2018-11-18 11:39:29,112 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:39:29,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-18 11:39:29,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 11:39:29,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 11:39:29,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1779 transitions. [2018-11-18 11:39:29,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:29,123 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 11:39:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1779 transitions. [2018-11-18 11:39:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 11:39:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 11:39:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-11-18 11:39:29,147 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 11:39:29,148 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-11-18 11:39:29,148 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:39:29,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1779 transitions. [2018-11-18 11:39:29,154 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:39:29,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:29,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:29,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:39:29,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:29,155 INFO L794 eck$LassoCheckResult]: Stem: 12459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 11:39:29,156 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13342#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13340#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 13339#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13337#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13336#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13335#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13334#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 13332#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13330#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13324#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 13323#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 13321#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 13319#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13317#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13315#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13313#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13311#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13309#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 13307#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 13305#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13303#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 13301#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13299#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13297#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13295#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13293#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13291#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13289#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13287#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13285#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13283#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13281#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13279#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13277#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13275#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13273#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13271#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13269#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13267#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13265#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13263#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13261#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13259#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13257#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13255#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13253#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13251#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13249#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13247#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 13245#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13243#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 13241#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13239#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13237#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13235#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13233#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13231#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13229#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 13227#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13225#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 13223#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 13221#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13219#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13217#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13215#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 13213#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13211#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 13209#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13207#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13205#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13203#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 13201#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13199#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 13197#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13195#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13193#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13191#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 13189#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13187#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13185#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13183#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13181#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13179#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13177#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13175#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13173#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12355#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13170#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13168#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13166#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13164#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13162#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13160#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13158#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13156#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13154#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13151#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13149#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13147#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13145#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13143#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13141#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13139#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13137#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13135#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13133#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13132#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13131#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13129#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13127#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13125#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13124#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12493#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13397#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13395#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13393#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13391#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13389#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13387#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13385#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13383#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13381#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13379#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13377#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13375#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13373#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13371#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13369#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13367#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13365#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13363#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13361#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13359#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13357#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13355#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13353#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13351#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13349#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13347#L594-1 calculate_output_#res := -2; 13345#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 11:39:29,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 11:39:29,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:29,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:29,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 11:39:29,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:29,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:29,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 11:39:29,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:29,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:39:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:39:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:39:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:39:30,394 WARN L180 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 11:39:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:39:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:39:30,464 INFO L87 Difference]: Start difference. First operand 1496 states and 1779 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-11-18 11:39:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:39:31,321 INFO L93 Difference]: Finished difference Result 1688 states and 1968 transitions. [2018-11-18 11:39:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:39:31,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1968 transitions. [2018-11-18 11:39:31,328 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 11:39:31,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1968 transitions. [2018-11-18 11:39:31,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 11:39:31,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 11:39:31,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1968 transitions. [2018-11-18 11:39:31,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:39:31,340 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1968 transitions. [2018-11-18 11:39:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1968 transitions. [2018-11-18 11:39:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 11:39:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 11:39:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1826 transitions. [2018-11-18 11:39:31,362 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-18 11:39:31,362 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-11-18 11:39:31,362 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:39:31,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1826 transitions. [2018-11-18 11:39:31,368 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 11:39:31,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:39:31,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:39:31,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:31,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:39:31,369 INFO L794 eck$LassoCheckResult]: Stem: 15664#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; 16954#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16950#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 16946#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16295#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15805#L597 [2018-11-18 11:39:31,369 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16271#L606-3 assume true; 16269#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16267#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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; 16265#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16263#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16261#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 16259#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16257#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 15805#L597 [2018-11-18 11:39:31,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:31,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 11:39:31,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:31,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:31,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:31,377 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 11:39:31,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:31,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:31,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:31,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:39:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 11:39:31,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:39:31,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:39:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:39:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:39:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:39:31,593 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:39:31,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:39:31,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:39:31,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:39:31,594 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:39:31,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:39:31,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:39:31,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label53_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 11:39:31,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:39:31,594 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:39:31,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:39:31,771 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:39:31,771 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,777 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,778 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,799 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,821 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,821 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,843 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,864 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,864 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,884 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,886 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,887 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,906 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,908 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,908 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,929 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,951 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,951 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,972 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:31,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:31,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:31,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:31,992 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,016 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,037 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,058 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,058 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,079 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,096 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,097 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:39:32,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,304 INFO L448 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=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {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}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,323 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,323 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,325 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,325 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,346 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:39:32,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,510 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,529 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,562 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,562 INFO L448 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_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:39:32,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:39:32,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:39:32,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:39:32,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 11:39:32,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:39:32 BoogieIcfgContainer [2018-11-18 11:39:32,624 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:39:32,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:39:32,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:39:32,625 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:39:32,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:39:22" (3/4) ... [2018-11-18 11:39:32,628 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 11:39:32,667 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_73c3578b-172c-409d-8869-782f1225894c/bin-2019/uautomizer/witness.graphml [2018-11-18 11:39:32,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:39:32,668 INFO L168 Benchmark]: Toolchain (without parser) took 12091.55 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.2 MB). Free memory was 952.8 MB in the beginning and 1.5 GB in the end (delta: -501.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:39:32,668 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:39:32,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.8 MB in the beginning and 917.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,669 INFO L168 Benchmark]: Boogie Preprocessor took 51.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,669 INFO L168 Benchmark]: RCFGBuilder took 966.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,670 INFO L168 Benchmark]: BuchiAutomizer took 10481.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -435.0 MB). Peak memory consumption was 527.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,670 INFO L168 Benchmark]: Witness Printer took 42.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 313.2 kB). Peak memory consumption was 313.2 kB. Max. memory is 11.5 GB. [2018-11-18 11:39:32,672 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.18 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 426.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.8 MB in the beginning and 917.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 917.9 MB in the beginning and 1.1 GB in the end (delta: -209.3 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 966.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10481.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -435.0 MB). Peak memory consumption was 527.2 MB. Max. memory is 11.5 GB. * Witness Printer took 42.31 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 313.2 kB). Peak memory consumption was 313.2 kB. 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 10.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.9s. Construction of modules took 2.9s. Büchi inclusion checks took 1.0s. 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: 1468 SDtfs, 3083 SDslu, 488 SDs, 0 SdLazy, 3702 SolverSat, 851 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.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: 80ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@156178e5=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1436f79c=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@156178e5=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1436f79c=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@156178e5=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@1436f79c=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 -6*0^k + 1*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 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 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...