./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1aefec8ddab0c97dfdccb598d218efc3fd3f309 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:27:49,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:27:49,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:27:49,469 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:27:49,469 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:27:49,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:27:49,471 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:27:49,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:27:49,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:27:49,474 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:27:49,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:27:49,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:27:49,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:27:49,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:27:49,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:27:49,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:27:49,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:27:49,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:27:49,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:27:49,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:27:49,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:27:49,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:27:49,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:27:49,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:27:49,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:27:49,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:27:49,488 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:27:49,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:27:49,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:27:49,490 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:27:49,490 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:27:49,490 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:27:49,491 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:27:49,491 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:27:49,491 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:27:49,492 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:27:49,492 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 02:27:49,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:27:49,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:27:49,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:27:49,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:27:49,504 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:27:49,505 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:27:49,505 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:27:49,505 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:27:49,505 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:27:49,505 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:27:49,505 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:27:49,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:27:49,506 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:27:49,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:27:49,507 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:27:49,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:27:49,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:27:49,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:27:49,507 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:27:49,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:27:49,508 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:27:49,508 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:27:49,508 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:27:49,508 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_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1aefec8ddab0c97dfdccb598d218efc3fd3f309 [2018-11-10 02:27:49,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:27:49,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:27:49,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:27:49,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:27:49,543 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:27:49,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-11-10 02:27:49,580 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/data/376c16f5c/b16363d0d3ed44d9a4b330f7f26f7c5a/FLAG9e273a0c9 [2018-11-10 02:27:50,029 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:27:50,030 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-11-10 02:27:50,039 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/data/376c16f5c/b16363d0d3ed44d9a4b330f7f26f7c5a/FLAG9e273a0c9 [2018-11-10 02:27:50,051 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/data/376c16f5c/b16363d0d3ed44d9a4b330f7f26f7c5a [2018-11-10 02:27:50,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:27:50,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:27:50,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:27:50,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:27:50,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:27:50,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50, skipping insertion in model container [2018-11-10 02:27:50,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:27:50,099 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:27:50,321 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:27:50,325 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:27:50,388 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:27:50,399 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:27:50,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50 WrapperNode [2018-11-10 02:27:50,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:27:50,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:27:50,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:27:50,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:27:50,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:27:50,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:27:50,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:27:50,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:27:50,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... [2018-11-10 02:27:50,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:27:50,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:27:50,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:27:50,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:27:50,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:27:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:27:51,340 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:27:51,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:27:51 BoogieIcfgContainer [2018-11-10 02:27:51,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:27:51,341 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:27:51,341 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:27:51,344 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:27:51,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:27:51,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:27:50" (1/3) ... [2018-11-10 02:27:51,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:27:51, skipping insertion in model container [2018-11-10 02:27:51,345 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:27:51,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:50" (2/3) ... [2018-11-10 02:27:51,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:27:51, skipping insertion in model container [2018-11-10 02:27:51,346 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:27:51,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:27:51" (3/3) ... [2018-11-10 02:27:51,348 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label07_true-unreach-call_false-termination.c [2018-11-10 02:27:51,381 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:27:51,381 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:27:51,382 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:27:51,382 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:27:51,382 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:27:51,382 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:27:51,382 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:27:51,382 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:27:51,382 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:27:51,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 02:27:51,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 02:27:51,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:51,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:51,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:51,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:27:51,427 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:27:51,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 02:27:51,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 02:27:51,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:51,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:51,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:51,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:27:51,440 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 02:27:51,441 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 02:27:51,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:51,445 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 02:27:51,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:51,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:51,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:51,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:51,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:51,511 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 02:27:51,512 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:51,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:51,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:51,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:51,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 02:27:51,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:51,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:51,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:51,598 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 02:27:51,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:51,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:27:51,797 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:27:51,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:27:51,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:27:51,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:27:51,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:27:51,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:51,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:27:51,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:27:51,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 02:27:51,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:27:51,799 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:27:51,816 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 02:27:51,822 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 02:27:51,886 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 02:27:51,889 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 02:27:51,893 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 02:27:51,896 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 02:27:51,898 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 02:27:51,904 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 02:27:52,099 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:27:52,100 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:52,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,134 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,134 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:52,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,155 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,156 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_f198a777-3519-4b7b-a852-c47e546c58ba/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) [2018-11-10 02:27:52,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,191 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:52,232 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,232 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_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 02:27:52,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,238 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:52,244 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,244 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_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:52,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,300 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,300 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_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:52,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,311 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,311 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:52,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,350 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:52,350 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:52,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:52,377 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:52,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:27:52,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:52,435 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:27:52,436 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:27:52,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:27:52,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:27:52,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:27:52,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:27:52,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:52,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:27:52,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:27:52,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 02:27:52,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:27:52,437 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:27: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 02:27:52,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:27:52,452 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 02:27:52,492 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 02:27:52,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:27:52,498 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 02:27:52,503 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 02:27:52,505 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 02:27:52,696 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:27:52,700 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:27:52,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,723 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:52,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:52,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:52,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,766 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:52,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:52,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,776 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:27:52,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,789 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,791 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,795 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:52,795 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,797 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:27:52,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,821 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,828 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,832 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,832 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,836 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,838 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:52,838 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:52,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,848 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 02:27:52,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,850 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,885 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:52,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,890 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:52,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,913 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,916 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:52,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,919 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:52,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:52,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:52,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,926 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 02:27:52,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,928 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,938 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:52,938 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,940 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 02:27:52,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,958 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,962 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,965 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:52,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:52,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,968 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:52,968 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:52,969 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:52,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,973 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 02:27:52,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:52,974 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:52,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,975 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:52,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:52,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:52,988 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,989 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:52,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:52,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:52,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:52,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:52,992 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:52,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:52,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:52,993 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:52,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:52,994 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:27:52,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,023 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,024 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:53,024 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:53,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,029 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:53,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:53,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,033 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:53,033 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:53,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:53,043 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:53,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,045 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,045 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:53,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:53,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,051 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 02:27:53,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,052 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,054 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,067 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,067 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,076 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,076 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:53,076 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,079 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:53,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,109 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,109 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,109 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,110 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,118 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,118 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,119 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,123 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,123 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,131 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,133 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:53,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,134 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:53,134 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,135 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:53,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,142 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 02:27:53,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,143 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,143 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,145 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,158 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,158 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,165 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:53,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,169 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 02:27:53,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,206 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,207 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,215 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,215 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,216 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,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 02:27:53,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,221 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,221 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,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 02:27:53,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,228 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,228 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:53,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,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 02:27:53,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:53,230 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:53,232 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:53,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,242 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 02:27:53,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,242 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,243 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,244 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,254 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,257 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:53,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,258 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:53,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,276 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,276 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,277 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27: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 02:27:53,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,282 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,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 02:27:53,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,285 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,285 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,288 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,288 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:53,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,290 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:53,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,291 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:53,291 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:53,291 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:53,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,297 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 02:27:53,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,298 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,298 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,328 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,328 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,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 02:27:53,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,332 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,332 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:27:53,332 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,335 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 02:27:53,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,406 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27: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 02:27:53,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,420 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,424 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,424 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:53,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:53,429 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:53,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27: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 02:27:53,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:53,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:53,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:53,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:53,432 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:53,432 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:53,433 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:53,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:53,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:27:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:27:53,456 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 02:27:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:53,929 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 02:27:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:27:53,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 02:27:53,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 02:27:53,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 02:27:53,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 02:27:53,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 02:27:53,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 02:27:53,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:53,942 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 02:27:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 02:27:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 02:27:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 02:27:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 02:27:53,973 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 02:27:53,973 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 02:27:53,973 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:27:53,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 02:27:53,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 02:27:53,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:53,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:53,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:53,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:27:53,976 INFO L793 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 02:27:53,976 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 874#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 757#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 845#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 634#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 02:27:53,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 02:27:53,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:53,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:53,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:53,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 02:27:53,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:53,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:53,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:27:53,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:53,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 02:27:53,997 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:54,024 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 02:27:54,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:54,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:27:54,102 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:27:54,102 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:27:54,102 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:27:54,102 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:27:54,102 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:27:54,103 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:54,103 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:27:54,103 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:27:54,103 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 02:27:54,103 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:27:54,103 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:27:54,104 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 02:27:54,106 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 02:27:54,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:27:54,110 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 02:27:54,111 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 02:27:54,113 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 02:27:54,116 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 02:27:54,120 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 02:27:54,217 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:27:54,217 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,238 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:54,238 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,247 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:54,247 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,269 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:54,269 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,286 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,288 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:54,288 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,330 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:27:54,330 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:27:54,335 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:27:54,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:27:54,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:27:54,386 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:27:54,387 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:27:54,387 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:27:54,387 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:27:54,387 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:27:54,388 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:27:54,388 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:54,388 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:27:54,388 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:27:54,388 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 02:27:54,388 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:27:54,388 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:27:54,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 02:27:54,415 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 02:27:54,421 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 02:27:54,423 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 02:27:54,425 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 02:27:54,428 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 02:27:54,433 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 02:27:54,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:27:54,554 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:27:54,554 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:27:54,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:54,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:54,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,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 02:27:54,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,612 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,612 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:54,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,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 02:27:54,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:54,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,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 02:27:54,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,620 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:27:54,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:27:54,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,627 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:27:54,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,628 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,633 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,635 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,641 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,646 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,646 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,648 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 02:27:54,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,649 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,651 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,651 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,654 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,654 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,659 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,659 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,659 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,668 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,668 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,671 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 02:27:54,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,672 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,674 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,682 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,682 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,683 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,685 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,686 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,687 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,690 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,691 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,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 02:27:54,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,695 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:27:54,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,708 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,708 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,712 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 02:27:54,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,713 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,714 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,717 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,718 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,721 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,722 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,724 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,726 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,726 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,729 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,729 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,729 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,734 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,735 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:27:54,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:27:54,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,746 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 02:27:54,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,751 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,752 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,757 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,757 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,758 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,762 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,762 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,762 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,763 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,765 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,768 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,768 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,771 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,772 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,778 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,780 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,791 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:27:54,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,798 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 02:27:54,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,799 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,804 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,805 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,806 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,813 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,814 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,825 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,828 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,829 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,833 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,833 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,833 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,835 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,843 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,843 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,845 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:27:54,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:27:54,868 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:27:54,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,876 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 02:27:54,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,877 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,880 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,885 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,885 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,887 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,890 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,893 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,899 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,899 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,900 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:27:54,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:27:54,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:27:54,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:27:54,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,914 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 02:27:54,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,915 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,919 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,927 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,928 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:54,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,934 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,939 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,940 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:54,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,948 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,948 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:27:54,948 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,949 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:27:54,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:27:54,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:27:54,972 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:27:54,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:27:54,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:27:54,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:27:54,973 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:27:54,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:27:54,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:27:54,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:27:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:27:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:27:54,991 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 02:27:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:55,453 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 02:27:55,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:27:55,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 02:27:55,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 02:27:55,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 02:27:55,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 02:27:55,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 02:27:55,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 02:27:55,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:55,464 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 02:27:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 02:27:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 02:27:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 02:27:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 02:27:55,478 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 02:27:55,478 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 02:27:55,478 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:27:55,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 02:27:55,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 02:27:55,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:55,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:55,482 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:55,482 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 02:27:55,482 INFO L793 eck$LassoCheckResult]: Stem: 1796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-10 02:27:55,488 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1904#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1775#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1776#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1923#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2184#L606-3 assume true; 2182#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2180#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2178#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2176#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2174#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2172#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2170#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2168#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2166#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2164#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2162#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2160#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2158#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2156#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2154#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2152#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2150#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2147#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2145#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2143#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2141#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2139#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2137#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2135#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2133#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2131#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2129#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2127#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2125#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2123#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2121#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2119#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2117#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2115#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2113#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2111#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2109#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2107#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2105#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2103#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2101#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2099#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2097#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2095#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2093#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2091#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2089#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2088#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2086#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1782#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-10 02:27:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 02:27:55,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:55,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:55,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 02:27:55,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:55,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:55,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:27:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:55,548 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 02:27:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:27:55,549 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:27:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:27:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:27:55,549 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 02:27:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:56,281 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-10 02:27:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:27:56,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-10 02:27:56,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 02:27:56,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-10 02:27:56,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 02:27:56,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 02:27:56,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-10 02:27:56,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:56,292 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-10 02:27:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-10 02:27:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 02:27:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 02:27:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-10 02:27:56,307 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 02:27:56,307 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 02:27:56,307 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:27:56,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-10 02:27:56,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 02:27:56,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:56,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:56,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:56,314 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 02:27:56,315 INFO L793 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 02:27:56,315 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4387#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4386#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4385#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4383#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4381#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4379#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4378#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4350#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3747#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4334#L606-3 assume true; 4332#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4330#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4328#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3711#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3815#L606-3 assume true; 3816#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4182#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4181#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4179#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4177#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4175#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4173#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4171#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4169#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4167#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4165#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4163#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4161#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4159#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4157#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4155#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4153#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4151#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4149#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4147#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4145#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4143#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4141#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4139#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4137#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4135#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4133#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4131#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4129#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4127#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4125#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4123#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4115#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4109#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4107#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4105#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4103#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4101#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4099#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4097#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4095#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4093#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4091#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4088#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4089#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 02:27:56,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 02:27:56,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:56,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:56,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:56,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 02:27:56,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:56,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:27:56,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:56,352 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 02:27:56,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:56,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:27:56,352 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:27:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:27:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:27:56,353 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-10 02:27:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:56,784 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-10 02:27:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:27:56,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-10 02:27:56,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 02:27:56,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-10 02:27:56,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 02:27:56,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 02:27:56,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-10 02:27:56,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:56,803 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-10 02:27:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-10 02:27:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 02:27:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 02:27:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-10 02:27:56,822 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 02:27:56,822 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-10 02:27:56,822 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:27:56,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-10 02:27:56,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:27:56,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:56,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:56,830 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:56,830 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 02:27:56,830 INFO L793 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 02:27:56,830 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7340#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7338#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7336#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7334#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7332#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7330#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7328#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7326#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7324#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7322#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7320#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7318#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7316#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7314#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7312#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7310#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7308#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6967#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6551#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6958#L606-3 assume true; 6956#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6954#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6952#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6539#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6959#L606-3 assume true; 6957#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6955#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6953#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6951#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6949#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6947#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6945#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6943#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6941#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6939#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6937#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6935#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6933#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6931#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6929#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6927#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6925#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6923#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6921#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6919#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6917#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6915#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6913#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6911#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6909#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6907#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6905#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6903#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6901#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6899#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6897#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6895#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6893#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6891#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6889#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6887#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6885#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6883#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6881#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6879#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6877#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6875#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6873#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6871#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6869#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6867#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6865#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6862#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6859#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6860#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 02:27:56,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 02:27:56,831 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:56,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:56,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:56,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 02:27:56,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:56,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:27:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:56,882 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 02:27:56,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:56,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:27:56,882 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:27:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:27:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:27:56,883 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-10 02:27:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:57,311 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 02:27:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:27:57,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 02:27:57,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:27:57,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 02:27:57,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 02:27:57,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 02:27:57,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 02:27:57,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:57,327 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:27:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 02:27:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 02:27:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 02:27:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 02:27:57,345 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:27:57,345 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:27:57,345 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:27:57,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 02:27:57,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:27:57,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:57,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:57,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:57,353 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 02:27:57,353 INFO L793 eck$LassoCheckResult]: Stem: 9450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 02:27:57,354 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10073#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10071#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10069#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10067#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10065#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10064#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10063#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10061#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10059#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10057#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10055#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10053#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10051#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10049#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10047#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10045#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10043#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9905#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9906#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10666#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10662#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10658#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10653#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10648#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10643#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10638#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10633#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10629#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9796#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9687#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9789#L606-3 assume true; 9787#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9785#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9783#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9781#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9779#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9777#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9775#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9773#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9771#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9769#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9767#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9765#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9763#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9761#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9759#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9757#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9755#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9753#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9751#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9749#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9747#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9745#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9743#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9741#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9739#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9737#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9735#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9732#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9730#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9728#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9726#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9724#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9722#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9720#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9718#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9716#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9714#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9712#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9710#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9708#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9706#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9704#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9702#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9700#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9698#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9696#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9694#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9692#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9689#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9690#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 02:27:57,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 02:27:57,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:57,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:57,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 02:27:57,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:57,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:27:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:57,413 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 02:27:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:27:57,415 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:27:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:27:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:27:57,416 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 02:27:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:57,661 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 02:27:57,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:27:57,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 02:27:57,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 02:27:57,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 02:27:57,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 02:27:57,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 02:27:57,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 02:27:57,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:57,676 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:27:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 02:27:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 02:27:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 02:27:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 02:27:57,693 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:27:57,693 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:27:57,693 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:27:57,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 02:27:57,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 02:27:57,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:57,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:57,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:27:57,699 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 02:27:57,699 INFO L793 eck$LassoCheckResult]: Stem: 12454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 02:27:57,700 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13733#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13731#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13729#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13079#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13080#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13603#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13602#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13600#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13598#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13596#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13594#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13593#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13592#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13590#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13588#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13586#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13584#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13582#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13580#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13578#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13576#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13574#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13573#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13572#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13570#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13568#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13566#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13564#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12848#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12359#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 12325#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 12326#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 12409#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 12410#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12438#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 12368#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 12369#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 12439#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 12372#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 12373#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 12584#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13571#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13569#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13567#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13565#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12846#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12847#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13559#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13557#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13555#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13553#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13457#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13458#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13724#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13723#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13721#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13719#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13717#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13715#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13714#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13713#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 12558#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 12535#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12536#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12511#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 12398#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12399#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 12508#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12390#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12391#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12388#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 12389#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12510#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 12419#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 12420#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 12605#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13629#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13628#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13626#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13624#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13622#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13620#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13618#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13616#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13614#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13612#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12554#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12386#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12387#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12355#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12356#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12501#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12502#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12464#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12465#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12549#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13816#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13815#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13702#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13700#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13697#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13694#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13692#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13690#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13688#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13687#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13686#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13685#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13683#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13681#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13679#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12486#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13787#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13785#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13783#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13781#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13779#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13777#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13775#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13773#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13771#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13769#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13767#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13765#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13763#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13761#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13759#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13757#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13756#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13754#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13752#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13750#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13748#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13746#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13744#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13742#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13740#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13738#L594-1 calculate_output_#res := -2; 13736#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 02:27:57,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 02:27:57,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:57,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:57,705 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 02:27:57,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:57,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:57,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:57,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 02:27:57,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:57,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:27:58,104 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 02:27:58,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:27:58,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 02:27:58,794 WARN L179 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 02:27:58,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:27:58,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:27:58,871 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 02:27:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:27:59,614 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 02:27:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:27:59,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 02:27:59,621 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 02:27:59,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 02:27:59,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 02:27:59,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 02:27:59,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 02:27:59,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:27:59,631 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 02:27:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 02:27:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 02:27:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 02:27:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 02:27:59,654 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 02:27:59,654 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 02:27:59,654 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:27:59,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 02:27:59,659 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 02:27:59,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:27:59,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:27:59,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:27:59,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:27:59,660 INFO L793 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16805#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16803#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16801#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16273#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15808#L597 [2018-11-10 02:27:59,660 INFO L795 eck$LassoCheckResult]: Loop: 15808#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16248#L606-3 assume true; 16246#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16244#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16242#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16240#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16238#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16236#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16234#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15808#L597 [2018-11-10 02:27:59,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 02:27:59,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:59,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:59,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 02:27:59,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:27:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 02:27:59,674 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:27:59,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:27:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:27:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:27:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:27:59,894 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:27:59,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:27:59,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:27:59,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:27:59,895 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:27:59,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:27:59,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:27:59,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:27:59,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 02:27:59,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:27:59,895 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:27:59,897 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 02:27:59,905 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 02:27:59,906 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 02:27:59,907 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 02:27:59,909 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 02:27:59,910 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 02:27:59,912 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 02:27:59,915 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 02:27:59,916 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 02:27:59,918 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 02:27:59,919 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 02:27:59,921 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 02:27:59,922 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 02:27:59,924 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 02:27:59,926 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 02:27:59,928 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 02:27:59,936 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 02:27:59,937 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 02:27:59,942 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 02:27:59,944 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 02:27:59,946 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 02:28:00,062 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:28:00,062 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,068 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,068 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,099 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,099 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,105 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,105 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,124 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,124 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,140 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,142 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,142 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,175 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,175 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,182 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,182 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,214 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,214 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,239 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,239 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,243 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,243 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,276 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,276 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,295 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,295 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,300 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,300 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,318 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,318 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,349 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,349 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,352 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:28:00,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,567 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,567 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,585 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,585 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,601 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:28:00,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,769 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,769 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,784 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,800 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,800 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,804 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,804 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_f198a777-3519-4b7b-a852-c47e546c58ba/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 02:28:00,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:28:00,819 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:28:00,821 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:28:00,821 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 02:28:00,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:28:00 BoogieIcfgContainer [2018-11-10 02:28:00,858 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:28:00,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:28:00,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:28:00,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:28:00,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:27:51" (3/4) ... [2018-11-10 02:28:00,861 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 02:28:00,898 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f198a777-3519-4b7b-a852-c47e546c58ba/bin-2019/uautomizer/witness.graphml [2018-11-10 02:28:00,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:28:00,899 INFO L168 Benchmark]: Toolchain (without parser) took 10844.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -108.1 MB). Peak memory consumption was 365.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,900 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:28:00,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -216.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,900 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,901 INFO L168 Benchmark]: RCFGBuilder took 797.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,901 INFO L168 Benchmark]: BuchiAutomizer took 9516.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -51.5 MB). Peak memory consumption was 524.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,901 INFO L168 Benchmark]: Witness Printer took 40.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:28:00,903 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.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 917.3 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 103.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 917.3 MB in the beginning and 1.1 GB in the end (delta: -216.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 797.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9516.92 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -51.5 MB). Peak memory consumption was 524.3 MB. Max. memory is 11.5 GB. * Witness Printer took 40.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.5s. Construction of modules took 2.6s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1470 SDtfs, 3079 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s 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: 73ms 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@4be1c285=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=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@1934dc09=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...