./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label51_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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 89e4d3b83e9299d0f8112c95fd72ee254e8bb8bf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:51:50,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:51:50,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:51:50,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:51:50,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:51:50,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:51:50,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:51:50,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:51:50,109 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:51:50,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:51:50,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:51:50,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:51:50,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:51:50,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:51:50,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:51:50,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:51:50,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:51:50,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:51:50,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:51:50,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:51:50,118 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:51:50,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:51:50,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:51:50,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:51:50,121 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:51:50,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:51:50,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:51:50,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:51:50,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:51:50,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:51:50,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:51:50,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:51:50,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:51:50,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:51:50,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:51:50,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:51:50,127 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:51:50,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:51:50,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:51:50,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:51:50,139 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:51:50,139 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:51:50,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:51:50,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:51:50,141 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:51:50,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:51:50,141 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:51:50,142 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:51:50,142 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 -> 89e4d3b83e9299d0f8112c95fd72ee254e8bb8bf [2018-11-10 05:51:50,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:51:50,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:51:50,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:51:50,174 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:51:50,174 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:51:50,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-10 05:51:50,210 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/data/e622d9171/201c35cce0cb4d61bea78987e882b2c5/FLAGfa10d49ac [2018-11-10 05:51:50,671 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:51:50,671 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/sv-benchmarks/c/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2018-11-10 05:51:50,680 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/data/e622d9171/201c35cce0cb4d61bea78987e882b2c5/FLAGfa10d49ac [2018-11-10 05:51:50,692 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/data/e622d9171/201c35cce0cb4d61bea78987e882b2c5 [2018-11-10 05:51:50,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:51:50,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:51:50,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:51:50,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:51:50,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:51:50,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:51:50" (1/1) ... [2018-11-10 05:51:50,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:50, skipping insertion in model container [2018-11-10 05:51:50,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:51:50" (1/1) ... [2018-11-10 05:51:50,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:51:50,746 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:51:50,965 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:51:50,969 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:51:51,030 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:51:51,042 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:51:51,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51 WrapperNode [2018-11-10 05:51:51,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:51:51,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:51:51,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:51:51,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:51:51,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:51:51,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:51:51,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:51:51,165 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:51:51,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... [2018-11-10 05:51:51,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:51:51,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:51:51,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:51:51,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:51:51,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:51,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:51:51,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:51:51,989 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:51:51,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:51 BoogieIcfgContainer [2018-11-10 05:51:51,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:51:51,990 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:51:51,990 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:51:51,992 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:51:51,993 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:51:51,993 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:51:50" (1/3) ... [2018-11-10 05:51:51,993 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:51:51, skipping insertion in model container [2018-11-10 05:51:51,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:51:51,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:51:51" (2/3) ... [2018-11-10 05:51:51,994 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:51:51, skipping insertion in model container [2018-11-10 05:51:51,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:51:51,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:51" (3/3) ... [2018-11-10 05:51:51,996 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2018-11-10 05:51:52,028 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:51:52,029 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:51:52,029 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:51:52,029 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:51:52,029 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:51:52,029 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:51:52,029 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:51:52,029 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:51:52,030 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:51:52,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 05:51:52,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 05:51:52,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:52,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:52,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:52,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:51:52,072 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:51:52,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 05:51:52,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 05:51:52,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:52,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:52,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:52,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:51:52,083 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 05:51:52,084 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 05:51:52,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 05:51:52,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:52,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:52,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 05:51:52,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:52,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:52,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:52,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 05:51:52,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:52,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:52,246 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 05:51:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:52,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:51:52,362 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:51:52,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:51:52,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:51:52,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:51:52,363 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:51:52,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:52,363 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:51:52,363 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:51:52,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 05:51:52,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:51:52,364 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:51:52,384 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 05:51:52,389 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 05:51:52,429 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 05:51:52,431 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 05:51:52,436 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 05:51:52,439 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 05:51:52,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 05:51:52,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 05:51:52,610 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:51:52,610 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,615 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,635 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,635 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,648 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,648 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,700 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,700 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,724 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,724 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 05:51:52,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,757 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:52,799 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,800 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 05:51:52,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,806 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:52,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,856 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:52,856 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:52,874 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:52,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:51:52,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:52,938 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:51:52,940 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:51:52,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:51:52,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:51:52,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:51:52,941 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:51:52,941 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:52,941 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:51:52,941 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:51:52,941 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 05:51:52,941 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:51:52,941 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:51:52,943 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 05:51:52,969 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 05:51:52,972 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 05:51:53,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:53,072 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 05:51:53,075 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 05:51:53,083 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 05:51:53,090 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 05:51:53,255 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:51:53,261 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:51:53,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,282 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:53,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,317 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:53,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,322 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 05:51:53,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,324 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,324 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,332 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,332 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,336 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,338 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 05:51:53,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,353 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,358 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,361 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,361 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,365 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,367 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,373 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 05:51:53,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,375 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,384 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,387 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,387 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,389 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:53,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,406 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,410 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,419 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,420 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:53,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,424 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 05:51:53,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,425 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,426 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,433 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,437 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,437 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,439 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 05:51:53,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,453 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,453 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,458 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,461 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,461 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,464 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,465 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,465 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:53,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,466 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,467 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,467 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:53,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,471 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 05:51:53,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,472 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,473 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,474 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,491 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,491 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,493 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 05:51:53,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,520 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,521 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,526 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,526 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,533 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,534 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,534 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,538 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,538 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:53,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,540 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,540 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,540 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:53,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,546 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 05:51:53,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,547 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,549 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,566 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,567 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,567 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,570 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:53,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,599 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,606 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,610 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,611 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,618 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:53,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,619 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:53,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,626 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 05:51:53,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,627 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,627 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,629 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,640 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,640 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,641 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,642 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,648 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,653 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 05:51:53,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,686 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,686 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,686 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,688 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,695 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,700 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,701 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:53,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:53,711 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:53,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,719 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 05:51:53,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 05:51:53,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,720 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,733 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,733 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,735 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:53,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,755 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,758 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:53,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:53,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:53,765 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:53,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,769 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 05:51:53,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 05:51:53,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,771 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,799 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,803 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,803 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 05:51:53,803 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,806 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 05:51:53,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,876 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,887 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,892 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:53,896 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,896 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:53,896 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:53,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,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 05:51:53,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:53,900 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:53,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:53,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:53,901 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:53,901 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:53,902 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:53,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:53,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:53,926 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 05:51:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:54,514 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 05:51:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:54,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 05:51:54,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 05:51:54,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 05:51:54,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 05:51:54,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 05:51:54,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 05:51:54,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:54,528 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 05:51:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 05:51:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 05:51:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 05:51:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 05:51:54,555 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 05:51:54,555 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 05:51:54,555 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:51:54,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 05:51:54,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 05:51:54,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:54,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:54,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:54,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:51:54,560 INFO L793 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-10 05:51:54,560 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 851#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 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); 876#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 901#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); 949#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 948#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); 946#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 944#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-10 05:51:54,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 05:51:54,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:54,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:54,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 05:51:54,566 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:54,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:54,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 05:51:54,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:54,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:54,595 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 05:51:54,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:54,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:51:54,716 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:51:54,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:51:54,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:51:54,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:51:54,717 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:51:54,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:54,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:51:54,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:51:54,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 05:51:54,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:51:54,717 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:51:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:54,723 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 05:51:54,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:54,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:54,731 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 05:51:54,733 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 05:51:54,735 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 05:51:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:54,832 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:51:54,832 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:54,851 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:54,852 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,860 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,860 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:54,863 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:54,863 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:54,882 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:54,883 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:54,904 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:54,904 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,922 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:54,941 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:51:54,941 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:51:54,946 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:51:54,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:51:54,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:51:55,008 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:51:55,009 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:51:55,009 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:51:55,009 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:51:55,009 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:51:55,009 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:51:55,009 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:51:55,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:51:55,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:51:55,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 05:51:55,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:51:55,010 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:51:55,011 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 05:51:55,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 05:51:55,050 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 05:51:55,071 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 05:51:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:55,090 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 05:51:55,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:51:55,100 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 05:51:55,217 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:51:55,217 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:51:55,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:55,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:55,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,222 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,223 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:55,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:55,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,227 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:51:55,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:51:55,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,235 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 05:51:55,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,236 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,236 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,238 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,238 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,240 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,241 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,247 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,247 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,249 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,251 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,251 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,254 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,260 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,262 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 05:51:55,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,264 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,264 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,266 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,267 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,270 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,270 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,271 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,277 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,280 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,281 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,286 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,288 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 05:51:55,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,290 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,292 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,292 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,295 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,295 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,296 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,297 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,297 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,300 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,302 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,302 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,302 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,306 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,306 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,306 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:51:55,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,313 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,320 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 05:51:55,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,321 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,322 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,324 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,325 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,333 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,333 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,335 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,335 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,337 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,339 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,339 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,342 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,342 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,347 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,348 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,355 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 05:51:55,356 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 05:51:55,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,360 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 05:51:55,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,361 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,361 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,361 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,366 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,366 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,367 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,372 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,373 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,375 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,378 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,379 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,383 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,384 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,390 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,391 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,408 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 05:51:55,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,416 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 05:51:55,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,417 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,418 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,423 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,424 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,425 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,442 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,444 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,445 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,447 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,448 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,452 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,453 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,462 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,462 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,467 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 05:51:55,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,495 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 05:51:55,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 05:51:55,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,506 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 05:51:55,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,507 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,511 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,511 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,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 05:51:55,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,515 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,516 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,519 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,520 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,522 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,522 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,526 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,526 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,532 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,532 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,533 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 05:51:55,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,541 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 05:51:55,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 05:51:55,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 05:51:55,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,593 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 05:51:55,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,594 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,596 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,597 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,605 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,605 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,605 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,606 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:55,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,609 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,612 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,612 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,616 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,616 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,617 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:55,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,625 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 05:51:55,626 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,627 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 05:51:55,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 05:51:55,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 05:51:55,647 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 05:51:55,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:51:55,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:51:55,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:51:55,647 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 05:51:55,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 05:51:55,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:51:55,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:51:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:55,660 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 05:51:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:56,015 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-10 05:51:56,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:56,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-10 05:51:56,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 05:51:56,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 05:51:56,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 05:51:56,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 05:51:56,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-10 05:51:56,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:56,027 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 05:51:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-10 05:51:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 05:51:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 05:51:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 05:51:56,045 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 05:51:56,045 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 05:51:56,045 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:51:56,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-10 05:51:56,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 05:51:56,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:56,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:56,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:56,050 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 05:51:56,050 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; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 05:51:56,051 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1906#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1777#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; 1778#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); 1933#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2147#L606-3 assume true; 2145#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2143#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; 2141#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); 2139#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2137#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); 2135#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2133#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); 2131#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2129#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)); 2127#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); 2125#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); 2123#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); 2121#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2119#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); 2117#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2115#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2113#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2111#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); 2109#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); 2107#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2105#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); 2103#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2057#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2058#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); 2150#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2265#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2263#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2067#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2068#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2092#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2060#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2061#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); 2146#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2144#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2142#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2140#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); 2138#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2136#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2134#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); 2132#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2130#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); 2128#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); 2126#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2124#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); 2122#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2120#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2118#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)); 2116#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); 2114#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; 1821#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 05:51:56,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 05:51:56,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:56,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:56,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:56,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:56,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 05:51:56,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:56,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:56,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:56,119 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 05:51:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:56,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:51:56,120 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:51:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:51:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:51:56,120 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-10 05:51:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:56,744 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-11-10 05:51:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:51:56,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-11-10 05:51:56,750 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 05:51:56,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-11-10 05:51:56,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 05:51:56,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 05:51:56,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-11-10 05:51:56,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:56,759 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-11-10 05:51:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-11-10 05:51:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 05:51:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 05:51:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-11-10 05:51:56,776 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 05:51:56,776 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-11-10 05:51:56,776 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:51:56,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-11-10 05:51:56,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 05:51:56,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:56,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:56,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:56,783 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 05:51:56,783 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 05:51:56,784 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4374#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4372#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; 4370#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); 4368#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4366#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); 4364#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4362#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); 4314#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; 3748#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4297#L606-3 assume true; 4296#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4295#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; 4294#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; 3709#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4684#L606-3 assume true; 4179#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4169#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; 4168#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); 4166#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4164#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); 4162#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4160#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); 4158#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4156#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)); 4154#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); 4152#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); 4150#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); 4148#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4146#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); 4144#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4142#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4140#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4138#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); 4136#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); 4134#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4132#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); 4130#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4128#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4126#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); 4124#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4122#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); 4120#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); 4118#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4116#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4114#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4112#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4110#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); 4108#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4106#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4104#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4102#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); 4100#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4098#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4096#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); 4094#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4092#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); 4090#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); 4088#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4086#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); 4084#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4082#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4080#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)); 4078#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); 4075#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; 4076#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 05:51:56,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 05:51:56,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:56,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:56,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:56,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 05:51:56,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:56,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:56,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:56,821 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 05:51:56,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:56,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:51:56,821 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:51:56,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:56,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:56,822 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-10 05:51:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:57,158 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-11-10 05:51:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:57,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-11-10 05:51:57,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 05:51:57,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-11-10 05:51:57,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 05:51:57,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 05:51:57,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-11-10 05:51:57,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:57,170 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-11-10 05:51:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-11-10 05:51:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 05:51:57,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 05:51:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-11-10 05:51:57,184 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 05:51:57,184 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-11-10 05:51:57,184 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:51:57,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-11-10 05:51:57,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 05:51:57,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:57,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:57,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:57,189 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 05:51:57,189 INFO L793 eck$LassoCheckResult]: Stem: 6428#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 05:51:57,190 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7497#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7495#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; 7493#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); 7491#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7489#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); 7487#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7485#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); 7483#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7481#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)); 7479#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); 7477#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); 7475#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); 7473#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7471#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); 7469#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7467#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7465#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7463#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; 6538#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; 6448#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 05:51:57,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 05:51:57,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:57,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 05:51:57,194 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:57,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:57,266 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 05:51:57,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:57,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:51:57,266 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:51:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:57,267 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-10 05:51:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:57,678 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 05:51:57,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:57,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 05:51:57,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 05:51:57,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 05:51:57,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 05:51:57,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 05:51:57,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 05:51:57,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:57,690 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 05:51:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 05:51:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 05:51:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 05:51:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 05:51:57,702 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 05:51:57,702 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 05:51:57,702 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:51:57,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 05:51:57,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 05:51:57,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:57,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:57,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:57,708 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 05:51:57,708 INFO L793 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 05:51:57,708 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10005#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10003#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; 10001#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); 9999#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9997#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); 9995#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9993#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); 9991#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9989#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)); 9987#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); 9985#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); 9983#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); 9981#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9979#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); 9977#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9975#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9973#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9897#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); 9898#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); 10122#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10120#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); 10118#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10116#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10114#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); 10112#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10110#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); 10108#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); 10105#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9788#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; 9781#L606-3 assume true; 9779#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9777#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; 9775#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); 9773#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9771#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); 9769#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9767#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); 9765#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9763#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)); 9761#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); 9759#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); 9757#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); 9755#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9753#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); 9751#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9749#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9747#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9745#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); 9743#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); 9741#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9739#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); 9737#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9735#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9733#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); 9731#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9729#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); 9727#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); 9724#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9722#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9720#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9718#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9716#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); 9714#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9712#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9710#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9708#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); 9706#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9704#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9702#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); 9700#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9698#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); 9696#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); 9694#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9692#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); 9690#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9688#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9686#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)); 9684#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); 9681#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; 9682#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 05:51:57,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 05:51:57,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:57,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 05:51:57,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:51:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:57,771 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 05:51:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:57,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:51:57,772 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:51:57,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:51:57,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:51:57,772 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 05:51:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:57,964 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 05:51:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:51:57,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 05:51:57,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 05:51:57,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 05:51:57,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 05:51:57,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 05:51:57,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 05:51:57,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:57,975 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 05:51:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 05:51:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 05:51:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 05:51:57,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 05:51:57,989 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 05:51:57,989 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 05:51:57,989 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:51:57,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 05:51:57,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 05:51:57,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:51:57,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:51:57,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 05:51:57,994 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 05:51:57,995 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 05:51:57,996 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13013#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13011#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; 13009#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); 13007#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13005#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); 13003#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13001#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); 12999#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 12997#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)); 12995#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); 12993#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); 12991#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); 12989#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 12987#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); 12985#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 12983#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 12981#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 12979#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); 12977#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); 12975#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 12973#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); 12971#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 12969#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 12967#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); 12965#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12963#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); 12961#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); 12959#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12856#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12359#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 12325#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 12326#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 12409#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 12410#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12439#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 12368#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 12369#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 12440#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 12372#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 12373#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 12423#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); 12424#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); 13769#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13768#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); 13766#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12855#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12425#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)); 12426#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); 12427#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); 12428#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 12429#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); 12607#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13462#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13767#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); 13765#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); 13764#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13763#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13762#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); 13761#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13760#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); 13759#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); 12559#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 12537#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)); 12538#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12514#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 12398#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12399#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 12511#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12390#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12391#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12388#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 12389#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12513#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 12419#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 12420#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 12471#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 12472#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); 12512#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13694#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13693#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13691#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13689#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13609#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13608#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13607#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13606#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); 13605#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13604#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13603#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13602#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13135#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13109#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13108#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13106#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13104#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13101#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13099#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13097#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13095#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13093#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13091#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13089#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13087#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13085#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13083#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13081#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13079#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13077#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13075#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13073#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13071#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12489#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13068#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13066#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13064#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13062#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13060#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13058#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13056#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13054#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13052#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13050#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13048#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13046#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13044#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13042#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13040#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13038#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13036#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13034#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13032#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13030#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13028#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13026#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13024#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13022#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13020#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13018#L594-1 calculate_output_#res := -2; 13016#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 05:51:57,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:57,996 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 05:51:57,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:57,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:57,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:58,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 05:51:58,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:58,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:51:58,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:51:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 05:51:58,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:51:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:51:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:51:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:51:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:51:58,403 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 05:51:58,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:51:58,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:51:59,096 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 05:51:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:51:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:51:59,176 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 05:51:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:51:59,974 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 05:51:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:51:59,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 05:51:59,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 05:51:59,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 05:51:59,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 05:51:59,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 05:51:59,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 05:51:59,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:51:59,995 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 05:51:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 05:52:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 05:52:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 05:52:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 05:52:00,015 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 05:52:00,015 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 05:52:00,015 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:52:00,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 05:52:00,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 05:52:00,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:52:00,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:52:00,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:52:00,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:52:00,021 INFO L793 eck$LassoCheckResult]: Stem: 15663#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; 16203#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16201#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; 16199#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); 16197#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; 15803#L597 [2018-11-10 05:52:00,021 INFO L795 eck$LassoCheckResult]: Loop: 15803#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16294#L606-3 assume true; 16292#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16290#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; 16288#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); 16286#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16284#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); 16282#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16280#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; 15803#L597 [2018-11-10 05:52:00,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:52:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 05:52:00,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:52:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:52:00,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:52:00,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:52:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 05:52:00,028 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:52:00,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:52:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:52:00,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:52:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 05:52:00,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:52:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:52:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:52:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:52:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:52:00,190 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:52:00,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:52:00,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:52:00,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:52:00,190 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:52:00,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:52:00,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:52:00,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:52:00,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 05:52:00,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:52:00,190 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:52:00,192 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 05:52:00,197 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 05:52:00,199 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 05:52:00,204 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 05:52:00,205 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 05:52:00,207 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 05:52:00,209 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 05:52:00,211 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 05:52:00,213 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 05:52:00,215 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 05:52:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:52:00,218 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 05:52:00,220 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 05:52:00,222 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 05:52:00,223 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 05:52:00,225 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 05:52:00,231 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 05:52:00,232 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 05:52:00,238 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 05:52:00,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 05:52:00,241 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 05:52:00,358 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:52:00,359 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,365 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,365 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,398 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,398 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,406 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,406 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,424 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,424 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,443 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,444 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,476 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,476 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,481 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,481 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,512 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,513 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,537 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,537 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,542 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,542 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,574 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,575 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,578 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,594 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,594 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,597 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,599 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,600 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,619 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,619 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,651 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,651 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,653 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,672 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:52:00,672 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,869 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,869 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:00,888 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:00,888 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:00,905 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:00,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:52:00,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:01,071 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:01,071 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:01,087 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:01,087 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:01,102 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:01,103 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:01,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:01,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:01,110 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:01,110 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_a6ea9fc1-0a73-4d71-b576-6970bba5428a/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 05:52:01,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:52:01,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:52:01,128 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:52:01,128 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 05:52:01,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:52:01 BoogieIcfgContainer [2018-11-10 05:52:01,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:52:01,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:52:01,165 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:52:01,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:52:01,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:51:51" (3/4) ... [2018-11-10 05:52:01,169 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 05:52:01,207 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a6ea9fc1-0a73-4d71-b576-6970bba5428a/bin-2019/uautomizer/witness.graphml [2018-11-10 05:52:01,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:52:01,208 INFO L168 Benchmark]: Toolchain (without parser) took 10512.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 457.7 MB). Free memory was 957.6 MB in the beginning and 839.4 MB in the end (delta: 118.2 MB). Peak memory consumption was 575.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,208 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:52:01,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.82 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,209 INFO L168 Benchmark]: Boogie Preprocessor took 39.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,209 INFO L168 Benchmark]: RCFGBuilder took 783.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,209 INFO L168 Benchmark]: BuchiAutomizer took 9175.52 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 974.1 MB in the beginning and 839.4 MB in the end (delta: 134.7 MB). Peak memory consumption was 499.0 MB. Max. memory is 11.5 GB. [2018-11-10 05:52:01,210 INFO L168 Benchmark]: Witness Printer took 41.61 ms. Allocated memory is still 1.5 GB. Free memory is still 839.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:52:01,211 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.82 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 922.7 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 121.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 922.7 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 783.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 101.3 MB). Peak memory consumption was 101.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9175.52 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 974.1 MB in the beginning and 839.4 MB in the end (delta: 134.7 MB). Peak memory consumption was 499.0 MB. Max. memory is 11.5 GB. * Witness Printer took 41.61 ms. Allocated memory is still 1.5 GB. Free memory is still 839.4 MB. 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 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.4s. Construction of modules took 2.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s 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: 72ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - 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@2f9b75d4=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=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@226ad43c=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...