./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/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 b5d27e813284518a11dcc3cc5ae3d66f549ea677 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:36:59,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:36:59,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:36:59,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:36:59,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:36:59,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:36:59,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:36:59,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:36:59,824 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:36:59,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:36:59,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:36:59,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:36:59,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:36:59,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:36:59,829 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:36:59,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:36:59,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:36:59,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:36:59,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:36:59,834 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:36:59,835 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:36:59,836 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:36:59,838 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:36:59,838 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:36:59,838 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:36:59,839 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:36:59,840 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:36:59,840 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:36:59,841 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:36:59,842 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:36:59,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:36:59,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:36:59,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:36:59,843 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:36:59,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:36:59,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:36:59,844 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 10:36:59,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:36:59,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:36:59,858 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:36:59,858 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:36:59,859 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:36:59,859 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:36:59,860 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:36:59,860 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:36:59,861 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:36:59,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:36:59,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:36:59,862 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:36:59,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:36:59,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:36:59,862 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:36:59,863 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:36:59,863 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_85ad3ba2-f185-4494-8518-10e4ff30cefc/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 -> b5d27e813284518a11dcc3cc5ae3d66f549ea677 [2018-11-10 10:36:59,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:36:59,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:36:59,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:36:59,905 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:36:59,905 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:36:59,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-10 10:36:59,952 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/data/98bc662dc/3f8d515a2c664b21b843d7e5ab5a50e1/FLAG039ba0a8e [2018-11-10 10:37:00,378 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:37:00,378 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-10 10:37:00,389 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/data/98bc662dc/3f8d515a2c664b21b843d7e5ab5a50e1/FLAG039ba0a8e [2018-11-10 10:37:00,404 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/data/98bc662dc/3f8d515a2c664b21b843d7e5ab5a50e1 [2018-11-10 10:37:00,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:37:00,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:37:00,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:37:00,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:37:00,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:37:00,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00, skipping insertion in model container [2018-11-10 10:37:00,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:37:00,472 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:37:00,757 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:37:00,761 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:37:00,825 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:37:00,838 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:37:00,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00 WrapperNode [2018-11-10 10:37:00,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:37:00,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:37:00,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:37:00,839 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:37:00,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:37:00,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:37:00,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:37:00,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:37:00,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... [2018-11-10 10:37:00,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:37:00,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:37:00,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:37:00,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:37:00,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:01,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:37:01,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:37:01,984 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:37:01,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:01 BoogieIcfgContainer [2018-11-10 10:37:01,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:37:01,985 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:37:01,985 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:37:01,988 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:37:01,989 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:37:01,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:37:00" (1/3) ... [2018-11-10 10:37:01,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fa2913c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:01, skipping insertion in model container [2018-11-10 10:37:01,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:37:01,990 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:37:00" (2/3) ... [2018-11-10 10:37:01,990 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fa2913c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:37:01, skipping insertion in model container [2018-11-10 10:37:01,990 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:37:01,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:01" (3/3) ... [2018-11-10 10:37:01,992 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label16_false-unreach-call_false-termination.c [2018-11-10 10:37:02,033 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:37:02,034 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:37:02,034 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:37:02,034 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:37:02,034 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:37:02,034 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:37:02,034 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:37:02,035 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:37:02,035 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:37:02,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 10:37:02,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 10:37:02,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:02,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:02,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:02,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:37:02,087 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:37:02,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 10:37:02,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 10:37:02,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:02,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:02,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:02,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 10:37:02,101 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 10:37:02,101 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 10:37:02,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 10:37:02,108 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:02,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:02,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:02,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:02,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:02,190 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 10:37:02,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:02,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:02,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:02,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 10:37:02,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:02,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:02,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:02,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:37:02,419 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:02,420 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:02,420 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:02,420 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:02,420 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:37:02,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:02,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:02,421 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 10:37:02,421 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:02,421 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:02,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:02,706 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:02,707 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,751 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,751 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,771 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,771 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,838 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,838 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,864 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,864 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,933 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,933 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,947 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,948 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:02,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:02,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:02,991 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:02,991 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:03,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:03,037 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:03,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:37:03,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:03,139 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:37:03,141 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:03,141 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:03,141 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:03,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:03,142 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:37:03,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:03,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:03,142 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:03,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 10:37:03,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:03,143 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:03,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:03,448 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:03,452 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:37:03,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,474 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:03,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:03,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,533 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:03,534 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,543 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 10:37:03,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,545 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,546 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,558 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,558 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,566 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,566 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,569 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:37:03,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,587 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,597 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:03,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,613 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 10:37:03,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,626 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,630 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,630 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,634 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:03,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,650 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,656 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,666 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,667 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:03,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,670 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 10:37:03,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,680 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,680 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,683 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,683 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,685 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 10:37:03,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,701 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,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-10 10:37:03,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,707 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,708 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,713 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,713 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,717 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:03,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,723 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,723 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,723 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:03,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,727 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 10:37:03,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,729 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,743 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,744 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,747 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,747 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,749 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:37:03,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,773 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,774 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,782 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,785 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,786 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,793 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,794 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:03,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,795 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:03,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:03,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:03,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,802 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 10:37:03,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-10 10:37:03,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,803 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,817 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,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-10 10:37:03,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,824 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,825 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,828 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:03,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,867 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,868 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,873 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,874 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:03,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,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-10 10:37:03,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,881 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:03,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:03,882 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:03,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,890 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 10:37:03,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,893 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,909 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,910 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,911 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,917 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:03,918 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,922 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 10:37:03,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,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-10 10:37:03,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,963 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,971 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,972 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,978 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,982 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,988 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:03,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:03,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:03,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:03,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:03,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:03,996 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:03,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:03,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:03,996 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:03,996 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:03,998 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:03,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,016 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 10:37:04,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,018 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,031 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,034 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,039 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:04,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,040 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:04,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,058 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,059 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,067 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,070 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,071 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,072 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:04,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,077 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,077 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:04,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,078 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:04,078 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:04,078 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:04,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,084 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 10:37:04,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,086 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,116 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,116 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,121 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 10:37:04,121 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,124 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 10:37:04,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,197 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,197 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,210 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,210 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,218 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,221 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:04,222 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,222 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:04,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:04,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:04,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:04,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:04,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:04,227 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:04,227 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:04,228 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:04,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:04,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:04,254 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 10:37:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:04,823 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 10:37:04,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:04,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 10:37:04,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 10:37:04,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 10:37:04,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 10:37:04,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 10:37:04,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 10:37:04,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:04,837 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 10:37:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 10:37:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 10:37:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 10:37:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 10:37:04,864 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 10:37:04,864 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 10:37:04,864 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:37:04,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 10:37:04,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 10:37:04,867 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:04,867 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:04,868 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:04,868 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:04,868 INFO L793 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-10 10:37:04,868 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 967#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 966#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 965#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 964#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 963#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 962#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 961#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 960#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 959#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-10 10:37:04,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:04,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 10:37:04,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:04,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:04,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:04,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:04,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 10:37:04,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:04,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 10:37:04,887 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:04,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:04,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:04,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:37:05,014 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-10 10:37:05,043 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:05,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:05,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:05,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:05,043 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:37:05,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:05,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:05,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 10:37:05,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:05,044 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:05,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,230 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:05,230 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,250 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:05,250 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,260 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:05,260 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,283 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:05,283 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,306 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:05,306 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,360 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:05,360 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:05,365 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:37:05,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:05,442 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 10:37:05,444 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:05,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:05,444 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:05,444 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:05,444 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:37:05,444 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:05,444 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:05,444 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:05,444 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 10:37:05,444 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:05,444 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:05,568 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:05,568 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:37:05,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:05,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:05,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,574 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,574 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:05,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:05,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,581 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,581 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:37:05,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:37:05,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,586 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 10:37:05,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,587 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,589 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,589 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,591 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,593 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,594 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,595 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,596 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,597 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,604 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,606 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 10:37:05,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,607 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,609 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,612 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,612 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,614 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,621 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,622 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,627 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,630 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 10:37:05,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,631 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,634 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,634 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,637 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,637 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,639 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,641 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,643 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,647 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,647 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,648 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:37:05,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,657 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 10:37:05,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,658 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,658 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,659 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,662 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,666 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,666 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,666 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,666 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,668 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,669 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,674 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,679 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,679 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,680 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,688 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:37:05,689 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:37:05,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,692 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 10:37:05,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,693 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,697 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,703 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,703 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,705 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,709 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,709 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,710 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,713 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,713 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,714 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,721 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,734 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 10:37:05,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,740 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 10:37:05,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,741 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,741 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,742 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,746 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,747 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,748 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,754 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,754 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,754 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,754 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,755 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,760 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,760 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,761 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,765 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,765 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,767 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,777 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,780 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 10:37:05,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,798 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,799 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 10:37:05,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 10:37:05,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,811 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 10:37:05,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-10 10:37:05,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,816 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,821 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,830 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,837 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,838 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:37:05,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 10:37:05,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:37:05,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:37:05,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,855 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 10:37:05,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,855 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,856 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,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-10 10:37:05,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,870 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,870 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,870 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,871 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:05,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,874 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,878 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,878 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,882 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,882 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,882 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,883 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:05,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 10:37:05,893 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,895 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:37:05,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:37:05,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 10:37:05,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 10:37:05,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:37:05,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:37:05,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:37:05,919 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 10:37:05,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:37:05,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:37:05,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:37:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:05,942 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 10:37:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:06,431 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-10 10:37:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:06,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-10 10:37:06,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 10:37:06,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 10:37:06,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 10:37:06,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 10:37:06,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-10 10:37:06,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:06,441 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:37:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-10 10:37:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 10:37:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 10:37:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 10:37:06,461 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:37:06,462 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 10:37:06,462 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:37:06,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-10 10:37:06,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 10:37:06,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:06,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:06,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:06,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:06,468 INFO L793 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-10 10:37:06,470 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1902#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1775#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1930#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2152#L606-3 assume true; 2150#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2148#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2146#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2144#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2142#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2140#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2138#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2136#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2134#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2132#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2130#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2128#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2126#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2124#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2122#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2120#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2052#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2053#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2304#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2301#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2299#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2297#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2050#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2051#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2156#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2315#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2314#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2061#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2062#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2112#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2054#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2055#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2163#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2164#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2167#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2169#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2170#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 1777#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 1707#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 1709#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2172#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2173#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2175#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2293#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2291#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2289#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2287#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2285#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2283#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1818#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 10:37:06,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:06,470 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 10:37:06,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:06,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:06,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:06,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:06,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 10:37:06,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:06,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:06,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:06,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:37:06,552 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:37:06,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:37:06,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:37:06,555 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-10 10:37:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:07,267 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-10 10:37:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:37:07,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-10 10:37:07,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 10:37:07,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-10 10:37:07,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 10:37:07,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 10:37:07,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-10 10:37:07,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:07,286 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-10 10:37:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-10 10:37:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 10:37:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 10:37:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-10 10:37:07,313 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 10:37:07,313 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 10:37:07,313 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:37:07,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-10 10:37:07,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 10:37:07,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:07,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:07,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:07,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:07,321 INFO L793 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 10:37:07,321 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4436#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4434#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4432#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4430#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4428#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4426#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4424#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4423#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3750#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4389#L606-3 assume true; 4387#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4386#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4339#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3792#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4328#L606-3 assume true; 4202#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4191#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4190#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4188#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4186#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4184#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4182#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4180#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4178#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4176#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4174#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4172#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4170#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4168#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4166#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4164#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4162#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4160#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4158#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4156#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4154#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4152#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4150#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4148#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4146#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4144#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4142#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4140#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4138#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4136#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4134#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4132#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4130#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4128#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4126#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4124#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4122#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4120#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4118#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4116#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4114#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4112#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4110#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4108#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4106#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4104#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4102#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4100#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4097#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4098#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 10:37:07,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 10:37:07,322 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:07,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:07,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 10:37:07,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:07,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:07,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:07,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:37:07,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:07,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:07,361 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:37:07,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:07,362 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-10 10:37:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:07,939 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-10 10:37:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:07,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-10 10:37:07,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 10:37:07,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-10 10:37:07,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 10:37:07,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 10:37:07,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-10 10:37:07,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:07,956 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-10 10:37:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-10 10:37:07,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 10:37:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 10:37:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-10 10:37:07,975 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 10:37:07,975 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 10:37:07,975 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:37:07,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-10 10:37:07,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:37:07,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:07,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:07,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:07,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:07,983 INFO L793 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 10:37:07,983 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7281#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7279#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7277#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7275#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7273#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7271#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7269#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7267#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7265#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7263#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7261#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7259#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7257#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7255#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7253#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7251#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7249#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6938#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6929#L606-3 assume true; 6927#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6925#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6923#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6533#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6930#L606-3 assume true; 6928#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6926#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6924#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6922#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6920#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6918#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6916#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6914#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6912#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6910#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6908#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6906#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6904#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6902#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6900#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6898#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6896#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6894#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6892#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6890#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6888#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6886#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6884#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6882#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6880#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6878#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6876#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6874#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6872#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6870#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6868#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6866#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6864#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6862#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6860#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6858#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6856#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6854#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6852#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6850#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6848#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6846#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6844#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6842#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6840#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6838#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6836#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6833#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6830#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6831#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 10:37:07,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 10:37:07,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:07,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:07,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:07,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 10:37:07,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:07,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:07,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 10:37:08,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:08,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:08,039 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:37:08,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:08,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:08,039 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-10 10:37:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:08,675 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 10:37:08,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:08,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 10:37:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:37:08,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 10:37:08,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 10:37:08,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 10:37:08,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 10:37:08,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:08,691 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 10:37:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 10:37:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 10:37:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 10:37:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 10:37:08,711 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 10:37:08,711 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 10:37:08,712 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:37:08,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 10:37:08,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 10:37:08,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:08,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:08,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:08,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:08,719 INFO L793 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 10:37:08,719 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10507#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10505#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10503#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10501#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10499#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10497#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10495#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10488#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10489#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10483#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10484#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10586#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10584#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10582#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10580#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10578#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10577#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9926#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9927#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10192#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10190#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10188#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10186#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10184#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10182#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10180#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10178#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10176#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9787#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9677#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9780#L606-3 assume true; 9778#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9776#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9774#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9772#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9770#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9768#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9766#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9764#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9762#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9760#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9758#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9756#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9754#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9752#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9750#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9748#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9746#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9744#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9742#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9740#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9738#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9736#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9734#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9732#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9730#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9728#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9725#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9723#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9721#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9719#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9717#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9715#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9713#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9711#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9709#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9707#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9705#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9703#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9701#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9699#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9697#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9695#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9693#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9691#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9689#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9687#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9685#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9683#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9679#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 10:37:08,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 10:37:08,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:08,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:08,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:08,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:08,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 10:37:08,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:08,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:08,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:37:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:08,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:08,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:37:08,769 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:37:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:37:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:37:08,770 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 10:37:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:09,002 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 10:37:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:37:09,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 10:37:09,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 10:37:09,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 10:37:09,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 10:37:09,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 10:37:09,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 10:37:09,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:09,019 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 10:37:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 10:37:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 10:37:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 10:37:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 10:37:09,037 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 10:37:09,037 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 10:37:09,037 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:37:09,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 10:37:09,042 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 10:37:09,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:09,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:09,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 10:37:09,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:09,043 INFO L793 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-10 10:37:09,044 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 12563#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 12439#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 12440#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13077#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13078#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13748#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13746#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13744#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13745#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12349#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 12350#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13810#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13808#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13806#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13804#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13802#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13800#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13798#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13796#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 12407#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 12408#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 12409#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 12410#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13639#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13638#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13637#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13636#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13635#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12847#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12362#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 12325#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 12326#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 12411#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 12412#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12441#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 12371#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 12372#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 12442#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 12375#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 12376#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 12425#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 12394#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 12395#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 12501#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 12502#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12845#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12846#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13623#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13621#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13620#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13619#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13587#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13588#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13634#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 12451#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 12452#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13697#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13695#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13693#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13692#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13690#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13688#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13686#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13684#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13682#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13680#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13678#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13676#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13674#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13672#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13670#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13668#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13666#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13664#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13662#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13660#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13658#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13656#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13654#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13652#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13650#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13648#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13646#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13644#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13642#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13640#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12357#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12556#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12387#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12388#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12358#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12359#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13633#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13632#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13630#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13629#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12417#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12418#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12554#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12385#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12386#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12553#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12528#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12497#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12498#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12464#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12465#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12596#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13786#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13785#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13784#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13783#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12347#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12348#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13815#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13814#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13813#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13812#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13811#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13809#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13807#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13805#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13803#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13801#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13799#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13797#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13795#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12486#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12487#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12447#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12448#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12566#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12398#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12399#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12365#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12366#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12329#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12330#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12482#L594-1 calculate_output_#res := -2; 12483#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 10:37:09,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 10:37:09,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:09,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 10:37:09,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:09,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:09,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:09,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 10:37:09,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:37:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:37:09,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:37:09,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 10:37:10,032 WARN L179 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 10:37:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:37:10,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:37:10,093 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 10:37:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:37:10,877 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 10:37:10,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 10:37:10,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 10:37:10,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 10:37:10,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 10:37:10,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 10:37:10,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 10:37:10,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 10:37:10,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:37:10,892 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 10:37:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 10:37:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 10:37:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 10:37:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 10:37:10,910 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 10:37:10,910 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 10:37:10,910 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:37:10,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 10:37:10,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 10:37:10,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:37:10,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:37:10,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:10,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:37:10,916 INFO L793 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16873#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16871#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16869#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16315#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15808#L597 [2018-11-10 10:37:10,916 INFO L795 eck$LassoCheckResult]: Loop: 15808#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16293#L606-3 assume true; 16291#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16289#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16287#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16285#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16283#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16281#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16279#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15808#L597 [2018-11-10 10:37:10,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 10:37:10,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:10,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:10,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 10:37:10,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:10,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:10,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:10,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:37:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 10:37:10,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:37:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:37:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:37:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:37:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:37:11,107 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:37:11,107 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:37:11,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:37:11,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:37:11,107 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 10:37:11,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:37:11,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:37:11,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 10:37:11,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:37:11,108 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:37:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:37:11,275 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:37:11,275 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,280 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,281 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,324 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,324 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,330 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,330 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,349 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,349 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,368 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,368 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,400 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,400 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,406 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,406 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,438 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,438 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,459 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,459 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,463 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,463 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,495 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,495 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,514 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,514 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,520 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,520 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,538 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,538 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,570 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,570 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,572 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:37:11,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,789 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,789 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,807 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,807 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:11,824 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:11,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 10:37:11,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:11,992 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:11,992 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:12,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:12,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:12,023 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:12,024 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:12,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:12,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:12,033 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:12,033 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:37:12,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 10:37:12,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 10:37:12,051 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 10:37:12,051 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 10:37:12,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:37:12 BoogieIcfgContainer [2018-11-10 10:37:12,088 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:37:12,088 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:37:12,088 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:37:12,091 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:37:12,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:37:01" (3/4) ... [2018-11-10 10:37:12,094 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 10:37:12,126 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_85ad3ba2-f185-4494-8518-10e4ff30cefc/bin-2019/uautomizer/witness.graphml [2018-11-10 10:37:12,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:37:12,127 INFO L168 Benchmark]: Toolchain (without parser) took 11719.00 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.0 MB). Free memory was 955.4 MB in the beginning and 940.5 MB in the end (delta: 14.9 MB). Peak memory consumption was 511.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,127 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:37:12,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.88 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 915.1 MB in the beginning and 1.2 GB in the end (delta: -251.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,128 INFO L168 Benchmark]: Boogie Preprocessor took 39.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,128 INFO L168 Benchmark]: RCFGBuilder took 997.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,129 INFO L168 Benchmark]: BuchiAutomizer took 10102.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 317.7 MB). Free memory was 1.1 GB in the beginning and 951.5 MB in the end (delta: 108.7 MB). Peak memory consumption was 426.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,129 INFO L168 Benchmark]: Witness Printer took 38.13 ms. Allocated memory is still 1.5 GB. Free memory was 951.5 MB in the beginning and 940.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:37:12,131 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.88 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.1 MB in the end (delta: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 915.1 MB in the beginning and 1.2 GB in the end (delta: -251.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 997.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10102.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 317.7 MB). Free memory was 1.1 GB in the beginning and 951.5 MB in the end (delta: 108.7 MB). Peak memory consumption was 426.4 MB. Max. memory is 11.5 GB. * Witness Printer took 38.13 ms. Allocated memory is still 1.5 GB. Free memory was 951.5 MB in the beginning and 940.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. 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.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 3.0s. 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: 1469 SDtfs, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s 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: 75ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - 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@1f744327=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f89319f=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@1f744327=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f89319f=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@1f744327=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@4f89319f=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...