./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 49868ba3cc530a9d4dc385567f0a9711da3734c2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:07:39,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:07:39,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:07:39,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:07:39,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:07:39,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:07:39,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:07:39,838 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:07:39,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:07:39,840 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:07:39,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:07:39,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:07:39,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:07:39,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:07:39,843 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:07:39,844 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:07:39,845 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:07:39,846 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:07:39,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:07:39,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:07:39,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:07:39,850 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:07:39,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:07:39,852 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:07:39,853 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:07:39,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:07:39,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:07:39,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:07:39,855 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:07:39,856 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:07:39,856 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:07:39,857 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:07:39,857 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:07:39,857 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:07:39,858 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:07:39,858 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:07:39,858 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:07:39,869 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:07:39,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:07:39,871 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:07:39,871 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:07:39,871 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:07:39,871 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:07:39,871 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:07:39,871 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:07:39,872 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:07:39,872 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:07:39,872 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:07:39,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:07:39,872 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:07:39,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:07:39,873 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:07:39,874 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:07:39,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:07:39,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:07:39,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:07:39,874 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:07:39,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:07:39,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:07:39,875 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:07:39,875 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:07:39,876 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 -> 49868ba3cc530a9d4dc385567f0a9711da3734c2 [2018-11-10 11:07:39,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:07:39,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:07:39,912 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:07:39,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:07:39,914 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:07:39,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-11-10 11:07:39,962 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/data/02b5e3f5c/80f9e1bb8ce1472f9a99b71812870727/FLAGb16a46110 [2018-11-10 11:07:40,360 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:07:40,361 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/sv-benchmarks/c/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-11-10 11:07:40,371 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/data/02b5e3f5c/80f9e1bb8ce1472f9a99b71812870727/FLAGb16a46110 [2018-11-10 11:07:40,383 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/data/02b5e3f5c/80f9e1bb8ce1472f9a99b71812870727 [2018-11-10 11:07:40,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:07:40,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:07:40,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:07:40,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:07:40,390 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:07:40,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40, skipping insertion in model container [2018-11-10 11:07:40,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:07:40,435 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:07:40,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:07:40,678 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:07:40,751 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:07:40,766 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:07:40,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40 WrapperNode [2018-11-10 11:07:40,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:07:40,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:07:40,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:07:40,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:07:40,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:07:40,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:07:40,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:07:40,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:07:40,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... [2018-11-10 11:07:40,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:07:40,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:07:40,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:07:40,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:07:40,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:40,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:07:40,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:07:41,915 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:07:41,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:07:41 BoogieIcfgContainer [2018-11-10 11:07:41,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:07:41,917 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:07:41,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:07:41,920 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:07:41,921 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:07:41,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:07:40" (1/3) ... [2018-11-10 11:07:41,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de8571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:07:41, skipping insertion in model container [2018-11-10 11:07:41,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:07:41,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:07:40" (2/3) ... [2018-11-10 11:07:41,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4de8571e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:07:41, skipping insertion in model container [2018-11-10 11:07:41,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:07:41,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:07:41" (3/3) ... [2018-11-10 11:07:41,924 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-11-10 11:07:41,964 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:07:41,965 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:07:41,965 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:07:41,965 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:07:41,965 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:07:41,965 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:07:41,965 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:07:41,966 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:07:41,966 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:07:41,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 11:07:42,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 11:07:42,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:42,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:42,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:42,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:07:42,019 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:07:42,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 11:07:42,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 11:07:42,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:42,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:42,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:42,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 11:07:42,033 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 11:07:42,033 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 11:07:42,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 11:07:42,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:42,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:42,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:42,117 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 11:07:42,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:42,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:42,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:42,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 11:07:42,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:42,211 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 11:07:42,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:42,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:07:42,342 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-10 11:07:42,380 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:07:42,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:07:42,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:07:42,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:07:42,381 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:07:42,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:07:42,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:07:42,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:07:42,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label05_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 11:07:42,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:07:42,383 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:07:42,405 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 11:07:42,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:42,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:42,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 11:07:42,444 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 11:07:42,447 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 11:07:42,449 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 11:07:42,455 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 11:07:42,623 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:07:42,624 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,650 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,651 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,673 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,673 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,724 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,724 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,753 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,753 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,785 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,810 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,810 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,821 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,824 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,852 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:42,852 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:42,877 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:42,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:07:42,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:42,936 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:07:42,938 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:07:42,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:07:42,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:07:42,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:07:42,939 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:07:42,939 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:07:42,939 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:07:42,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:07:42,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label05_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 11:07:42,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:07:42,939 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:07:42,941 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 11:07:42,948 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 11:07:42,950 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 11:07:42,971 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 11:07:42,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:42,979 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 11:07:42,980 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 11:07:42,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:43,196 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:07:43,202 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:07:43,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,228 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:43,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:43,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,288 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:43,289 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,294 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:07:43,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,298 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,299 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,310 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,310 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,314 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,314 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,319 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:07:43,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,346 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,346 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,350 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,360 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:43,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,369 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:07:43,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,370 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,371 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,409 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,410 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,417 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,420 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:43,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,440 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,448 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,448 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,453 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,461 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:43,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,466 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:07:43,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,467 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,468 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,479 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,479 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,483 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,488 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:07:43,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,503 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,504 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,510 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,510 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,517 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,521 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,521 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:43,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,524 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:43,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,529 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:07:43,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 11:07:43,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,531 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,531 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,532 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,547 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,548 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,552 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,552 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,552 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,555 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:07:43,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,589 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,589 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,590 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,596 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,597 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,606 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,612 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:43,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,614 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,614 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:43,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:43,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,622 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:07:43,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,623 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,628 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,644 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,650 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,650 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,650 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,654 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:43,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,689 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,699 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,705 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,710 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,714 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:43,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,714 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:43,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,725 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:07:43,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,729 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,745 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,752 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,758 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:07:43,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,804 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,804 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,806 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,816 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,821 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,823 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,829 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,829 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,830 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:43,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,832 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,832 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:43,834 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:43,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,846 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:07:43,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 11:07:43,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,860 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,864 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,864 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,866 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:43,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,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 11:07:43,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,890 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,901 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,901 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,904 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:43,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:43,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,908 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:43,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:43,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:43,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,916 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:07:43,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:43,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:43,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,955 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:43,955 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:43,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:43,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:43,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:43,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:43,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:43,960 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:43,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:43,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:43,960 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 11:07:43,960 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:43,963 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 11:07:43,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:44,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:44,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:44,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:44,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:44,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:44,056 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:44,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:44,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,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 11:07:44,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:44,068 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:44,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:44,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:44,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:44,071 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:44,072 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:44,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:44,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:44,076 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:44,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:44,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:44,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:44,080 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:44,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:44,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,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 11:07:44,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:44,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:44,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:44,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:44,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:44,086 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:44,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:44,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:44,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:44,091 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:44,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:44,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:44,091 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:44,091 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:44,092 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:44,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:44,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:07:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:07:44,121 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 11:07:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:44,775 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 11:07:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:07:44,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 11:07:44,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 11:07:44,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 11:07:44,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 11:07:44,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 11:07:44,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 11:07:44,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:44,794 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 11:07:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 11:07:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 11:07:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 11:07:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 11:07:44,833 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 11:07:44,833 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 11:07:44,833 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:07:44,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 11:07:44,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 11:07:44,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:44,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:44,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:44,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:07:44,837 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; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 11:07:44,837 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 875#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 760#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 844#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 634#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 11:07:44,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 11:07:44,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:44,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:44,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 11:07:44,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:44,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:07:44,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:44,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 11:07:44,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:44,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:44,909 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 11:07:44,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:44,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:07:45,028 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:07:45,028 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:07:45,028 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:07:45,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:07:45,029 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:07:45,029 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:07:45,029 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:07:45,029 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:07:45,029 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label05_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 11:07:45,029 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:07:45,029 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:07:45,031 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 11:07:45,035 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 11:07:45,039 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 11:07:45,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 11:07:45,054 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 11:07:45,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 11:07:45,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 11:07:45,069 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 11:07:45,213 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:07:45,213 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,241 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:45,241 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,250 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:45,250 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,281 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:45,281 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,314 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:45,314 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,357 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:45,357 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:45,362 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:45,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:07:45,395 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:45,429 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:07:45,430 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:07:45,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:07:45,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:07:45,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:07:45,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:07:45,431 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:07:45,431 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:07:45,431 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:07:45,431 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label05_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 11:07:45,431 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:07:45,431 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:07:45,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:45,443 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 11:07:45,462 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 11:07:45,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 11:07:45,471 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 11:07:45,478 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 11:07:45,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 11:07:45,513 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 11:07:45,690 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:07:45,690 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:07:45,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:45,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:45,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,698 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:45,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:45,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,704 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:07:45,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:07:45,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,713 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:07:45,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,715 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,715 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,717 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,717 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,720 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,722 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,722 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,724 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,729 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,734 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,737 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:07:45,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,738 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,738 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,746 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,750 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,754 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,755 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,760 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,763 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:07:45,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,764 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,764 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,767 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,767 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,771 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,773 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,773 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,775 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,777 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,778 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,782 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,782 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,783 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:07:45,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,789 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,790 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,793 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:07:45,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,794 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,794 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,795 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,797 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,798 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,802 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,802 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,805 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,805 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,808 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,810 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,810 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,816 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,816 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,816 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,825 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:07:45,826 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:07:45,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,830 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:07:45,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,831 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,835 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,837 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,841 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,842 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,843 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,844 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,852 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,852 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,853 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,860 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,862 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,874 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:07:45,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,875 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,876 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,882 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:07:45,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,883 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,884 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,889 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,897 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,897 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,899 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,900 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,901 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,902 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,904 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,909 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,909 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,911 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,921 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,923 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 11:07:45,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,941 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:07:45,943 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:07:45,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,953 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:07:45,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,954 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,957 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,962 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,962 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,962 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,962 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,965 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,965 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,967 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,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 11:07:45,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,970 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,971 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,977 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,977 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:45,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,978 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:07:45,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,986 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:07:45,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:07:45,987 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:07:45,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,993 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:07:45,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,994 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:45,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:45,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:45,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:45,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:45,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:45,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:45,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:45,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:45,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:45,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:45,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,007 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,007 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:46,007 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,008 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:46,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,010 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:46,011 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:46,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,014 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:46,015 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:46,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,019 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:46,019 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,020 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:46,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,029 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 11:07:46,030 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,031 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:07:46,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:07:46,054 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:07:46,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:07:46,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:07:46,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:07:46,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:07:46,054 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:07:46,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:07:46,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:07:46,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:07:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:07:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:07:46,076 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 11:07:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:46,492 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 11:07:46,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:07:46,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 11:07:46,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 11:07:46,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 11:07:46,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 11:07:46,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 11:07:46,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 11:07:46,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:46,505 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:07:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 11:07:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 11:07:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 11:07:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 11:07:46,523 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:07:46,523 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 11:07:46,523 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:07:46,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 11:07:46,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 11:07:46,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:46,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:46,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:46,531 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 11:07:46,531 INFO L793 eck$LassoCheckResult]: Stem: 1797#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-10 11:07:46,532 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1903#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1775#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1776#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1920#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2185#L606-3 assume true; 2183#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2181#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; 2179#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); 2177#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2175#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); 2173#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2171#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); 2169#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2167#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)); 2165#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); 2163#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); 2161#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); 2159#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2157#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); 2155#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2153#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2151#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2148#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); 2146#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); 2144#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2142#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); 2140#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2138#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2136#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); 2134#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2132#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); 2130#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); 2128#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2126#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2124#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2122#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2120#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); 2118#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2116#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2114#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2112#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); 2110#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2108#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2106#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); 2104#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2102#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); 2100#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); 2098#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2096#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); 2094#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2092#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2090#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)); 2089#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); 2087#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; 1783#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-10 11:07:46,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:46,536 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 11:07:46,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:46,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:46,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:46,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:46,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:46,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 11:07:46,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:46,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:46,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:46,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:07:46,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:46,595 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 11:07:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:46,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:07:46,597 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:07:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:07:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:07:46,598 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 11:07:47,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:47,496 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-10 11:07:47,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:07:47,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-10 11:07:47,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 11:07:47,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-10 11:07:47,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 11:07:47,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 11:07:47,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-10 11:07:47,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:47,510 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-10 11:07:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-10 11:07:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 11:07:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 11:07:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-10 11:07:47,530 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 11:07:47,530 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-10 11:07:47,530 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:07:47,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-10 11:07:47,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 11:07:47,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:47,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:47,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:47,537 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 11:07:47,537 INFO L793 eck$LassoCheckResult]: Stem: 3690#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 11:07:47,592 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 3811#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3671#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; 3672#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); 3844#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 3699#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); 3630#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3631#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); 4327#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3747#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4309#L606-3 assume true; 4307#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4305#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; 4303#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; 3670#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4552#L606-3 assume true; 4192#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4181#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; 4180#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); 4178#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4176#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); 4174#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4172#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); 4170#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4168#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)); 4166#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); 4164#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); 4162#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); 4160#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4158#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); 4156#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4154#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4152#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4150#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); 4148#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); 4146#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4144#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); 4142#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4140#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4138#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); 4136#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4134#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); 4132#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); 4130#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4128#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4126#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4124#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4122#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); 4120#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4118#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4116#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4114#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); 4112#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4110#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4108#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); 4106#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4104#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); 4102#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); 4100#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4098#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); 4096#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4094#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4092#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)); 4090#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4088#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3714#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 11:07:47,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 11:07:47,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:47,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:47,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 11:07:47,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:47,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:47,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:47,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:07:47,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:47,635 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 11:07:47,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:47,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:07:47,636 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:07:47,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:07:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:07:47,639 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-10 11:07:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:48,022 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-10 11:07:48,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:07:48,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-10 11:07:48,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 11:07:48,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-10 11:07:48,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 11:07:48,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 11:07:48,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-10 11:07:48,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:48,038 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-10 11:07:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-10 11:07:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 11:07:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 11:07:48,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-10 11:07:48,053 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 11:07:48,053 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 11:07:48,054 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:07:48,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-10 11:07:48,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:07:48,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:48,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:48,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:48,060 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 11:07:48,061 INFO L793 eck$LassoCheckResult]: Stem: 6432#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 11:07:48,061 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7626#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7625#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; 7623#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); 7622#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7620#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); 7618#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7616#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); 7610#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7611#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)); 7608#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); 6311#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); 6312#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); 6557#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6449#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); 6450#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6501#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6502#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6928#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; 6536#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6918#L606-3 assume true; 6916#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6914#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; 6912#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; 6452#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6920#L606-3 assume true; 6919#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6917#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; 6915#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); 6913#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6911#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); 6909#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6907#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); 6905#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6903#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)); 6901#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); 6899#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); 6897#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); 6895#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6893#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); 6891#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6889#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6887#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6885#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); 6883#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); 6881#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6879#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); 6877#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6875#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6873#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); 6871#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6869#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); 6867#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); 6865#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6863#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6861#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6859#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6857#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); 6855#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6853#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6851#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6849#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); 6847#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6845#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6843#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); 6841#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6839#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); 6837#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); 6835#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6833#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); 6831#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6829#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6827#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)); 6825#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); 6821#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; 6822#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 11:07:48,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,061 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 11:07:48,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:48,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 11:07:48,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:07:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:48,098 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 11:07:48,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:48,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:07:48,099 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:07:48,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:07:48,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:07:48,099 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-10 11:07:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:48,451 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 11:07:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:07:48,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 11:07:48,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:07:48,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 11:07:48,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 11:07:48,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 11:07:48,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 11:07:48,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:48,464 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 11:07:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 11:07:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 11:07:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 11:07:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 11:07:48,478 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 11:07:48,478 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 11:07:48,479 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:07:48,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 11:07:48,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 11:07:48,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:48,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:48,485 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:48,486 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 11:07:48,486 INFO L793 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 11:07:48,486 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10131#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10129#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; 10128#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); 10126#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10125#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); 10124#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10123#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); 10110#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10111#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)); 10104#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); 10105#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); 10122#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); 10121#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10120#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); 10118#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10116#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10114#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9901#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); 9902#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); 10060#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10058#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); 10056#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10054#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10052#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); 10050#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10048#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); 10046#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); 10044#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9789#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; 9679#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9782#L606-3 assume true; 9780#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9778#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; 9776#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); 9774#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9772#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); 9770#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9768#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); 9766#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9764#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)); 9762#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); 9760#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); 9758#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); 9756#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9754#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); 9752#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9750#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9748#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9746#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); 9744#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); 9742#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9740#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); 9738#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9736#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9734#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); 9732#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9730#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); 9728#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); 9725#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9723#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9721#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9719#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9717#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); 9715#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9713#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9711#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9709#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); 9707#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9705#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9703#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); 9701#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9699#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); 9697#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); 9695#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9693#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); 9691#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9689#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9687#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)); 9685#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); 9682#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; 9683#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 11:07:48,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 11:07:48,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:48,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 11:07:48,491 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:07:48,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:48,553 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 11:07:48,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:48,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:07:48,553 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:07:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:07:48,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:07:48,554 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 11:07:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:48,764 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 11:07:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:07:48,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 11:07:48,770 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 11:07:48,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 11:07:48,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 11:07:48,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 11:07:48,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 11:07:48,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:48,778 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 11:07:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 11:07:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 11:07:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 11:07:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 11:07:48,792 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 11:07:48,792 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 11:07:48,792 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:07:48,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 11:07:48,797 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 11:07:48,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:48,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:48,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 11:07:48,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:07:48,798 INFO L793 eck$LassoCheckResult]: Stem: 12457#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 11:07:48,799 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13177#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13175#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; 13173#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); 13171#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13169#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); 13167#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13165#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); 13163#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13161#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)); 13159#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); 13157#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); 13155#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); 13153#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13151#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); 13150#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13148#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13146#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13144#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); 13142#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); 13140#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13138#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); 13136#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13134#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13132#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); 13130#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13128#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); 13126#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); 13125#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12867#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12868#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13099#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13098#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); 13096#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13094#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13092#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13090#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); 13088#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13086#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13084#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); 13082#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13080#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); 13078#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); 13076#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13074#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); 13072#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13070#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13068#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)); 13066#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); 13064#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); 13062#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13060#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); 13058#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13056#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13054#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); 13052#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); 13050#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13048#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13046#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); 13044#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13042#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); 13040#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); 13038#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13036#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)); 13034#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13032#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); 13030#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13028#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)); 13026#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13024#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13022#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13020#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)); 13018#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13016#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)); 13014#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13012#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13010#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13008#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); 13006#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13004#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13002#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13000#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12998#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12996#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12994#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12992#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12990#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13284#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13282#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13280#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13278#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13276#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13274#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13272#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13270#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13268#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12549#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13265#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13263#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13261#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13259#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13257#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13255#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13253#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13251#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13249#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13247#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13245#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13243#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13241#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13239#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13237#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13234#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13232#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13230#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13228#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13226#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13224#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13222#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13220#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13218#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13216#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13214#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13212#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13210#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13208#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13206#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13204#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13202#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13200#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13198#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13196#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13194#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13192#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13190#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13186#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13184#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13182#L594-1 calculate_output_#res := -2; 13180#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 11:07:48,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 11:07:48,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 11:07:48,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 11:07:48,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:48,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:07:49,211 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 11:07:49,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:07:49,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:07:49,894 WARN L179 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 11:07:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:07:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:07:49,964 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 11:07:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:07:50,860 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 11:07:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:07:50,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 11:07:50,869 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 11:07:50,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 11:07:50,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 11:07:50,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 11:07:50,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 11:07:50,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:07:50,882 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 11:07:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 11:07:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 11:07:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 11:07:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 11:07:50,906 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 11:07:50,906 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 11:07:50,906 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:07:50,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 11:07:50,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 11:07:50,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:07:50,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:07:50,914 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:07:50,914 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:07:50,914 INFO L793 eck$LassoCheckResult]: Stem: 15664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16355#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16353#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; 16351#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); 16349#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; 15805#L597 [2018-11-10 11:07:50,914 INFO L795 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16277#L606-3 assume true; 16275#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16273#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; 16271#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); 16269#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16267#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); 16265#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16263#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; 15805#L597 [2018-11-10 11:07:50,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 11:07:50,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:50,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:50,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:50,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 11:07:50,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:50,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:50,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:50,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:07:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 11:07:50,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:07:50,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:07:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:07:50,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:07:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:07:51,116 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:07:51,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:07:51,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:07:51,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:07:51,117 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:07:51,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:07:51,117 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:07:51,117 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:07:51,117 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label05_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 11:07:51,117 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:07:51,117 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:07:51,118 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 11:07:51,121 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 11:07:51,123 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 11:07:51,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 11:07:51,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 11:07:51,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 11:07:51,132 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 11:07:51,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 11:07:51,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:07:51,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 11:07:51,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 11:07:51,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 11:07:51,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 11:07:51,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 11:07:51,149 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 11:07:51,151 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 11:07:51,159 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 11:07:51,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 11:07:51,171 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 11:07:51,174 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 11:07:51,177 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 11:07:51,313 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:07:51,313 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,320 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,323 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,323 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,362 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,362 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,370 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,370 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,393 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,393 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,416 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,417 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,456 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,456 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,468 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,468 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,507 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,507 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,530 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,530 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,536 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,536 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,575 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,576 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,598 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,598 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,605 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,605 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,627 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,627 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,667 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,667 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,671 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:07:51,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,927 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,927 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,945 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:51,948 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:51,948 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:51,967 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:51,989 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:07:51,989 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:52,159 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:52,159 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:52,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:52,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:52,196 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:52,196 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:52,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:52,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:52,202 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:52,202 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_83e7d094-806a-4ebb-aed5-12a1212d3173/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 11:07:52,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:07:52,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:07:52,224 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:07:52,224 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 11:07:52,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:07:52 BoogieIcfgContainer [2018-11-10 11:07:52,269 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:07:52,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:07:52,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:07:52,269 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:07:52,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:07:41" (3/4) ... [2018-11-10 11:07:52,275 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 11:07:52,320 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_83e7d094-806a-4ebb-aed5-12a1212d3173/bin-2019/uautomizer/witness.graphml [2018-11-10 11:07:52,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:07:52,321 INFO L168 Benchmark]: Toolchain (without parser) took 11934.51 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 469.2 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -78.4 MB). Peak memory consumption was 390.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,322 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 11:07:52,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.49 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -212.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,323 INFO L168 Benchmark]: Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,323 INFO L168 Benchmark]: RCFGBuilder took 983.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,323 INFO L168 Benchmark]: BuchiAutomizer took 10351.89 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.7 MB). Peak memory consumption was 520.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:07:52,324 INFO L168 Benchmark]: Witness Printer took 51.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:07:52,326 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 379.49 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -212.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 983.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10351.89 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -19.7 MB). Peak memory consumption was 520.5 MB. Max. memory is 11.5 GB. * Witness Printer took 51.07 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 6.0s. Construction of modules took 2.7s. 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, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 95ms 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@5a15d427=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b324a87=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@5a15d427=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b324a87=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@5a15d427=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@3b324a87=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...