./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:54:19,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:54:19,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:54:19,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:54:19,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:54:19,537 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:54:19,537 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:54:19,539 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:54:19,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:54:19,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:54:19,541 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:54:19,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:54:19,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:54:19,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:54:19,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:54:19,543 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:54:19,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:54:19,545 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:54:19,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:54:19,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:54:19,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:54:19,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:54:19,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:54:19,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:54:19,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:54:19,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:54:19,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:54:19,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:54:19,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:54:19,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:54:19,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:54:19,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:54:19,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:54:19,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:54:19,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:54:19,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:54:19,556 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 01:54:19,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:54:19,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:54:19,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:54:19,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:54:19,567 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:54:19,568 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:54:19,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:54:19,568 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:54:19,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:54:19,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:54:19,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:54:19,570 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:54:19,571 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:54:19,571 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2018-11-10 01:54:19,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:54:19,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:54:19,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:54:19,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:54:19,606 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:54:19,606 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-11-10 01:54:19,651 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/data/a26578972/70fa098da2c24e85907e33f4f816671a/FLAG8a5078d17 [2018-11-10 01:54:20,098 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:54:20,102 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-11-10 01:54:20,111 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/data/a26578972/70fa098da2c24e85907e33f4f816671a/FLAG8a5078d17 [2018-11-10 01:54:20,122 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/data/a26578972/70fa098da2c24e85907e33f4f816671a [2018-11-10 01:54:20,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:54:20,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:54:20,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:54:20,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:54:20,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:54:20,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56afb46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20, skipping insertion in model container [2018-11-10 01:54:20,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:54:20,169 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:54:20,400 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:54:20,403 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:54:20,467 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:54:20,478 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:54:20,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20 WrapperNode [2018-11-10 01:54:20,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:54:20,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:54:20,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:54:20,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:54:20,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:54:20,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:54:20,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:54:20,578 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:54:20,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... [2018-11-10 01:54:20,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:54:20,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:54:20,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:54:20,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:54:20,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:20,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:54:20,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:54:21,408 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:54:21,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:21 BoogieIcfgContainer [2018-11-10 01:54:21,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:54:21,409 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:54:21,409 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:54:21,412 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:54:21,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:54:21,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:54:20" (1/3) ... [2018-11-10 01:54:21,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ac72564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:54:21, skipping insertion in model container [2018-11-10 01:54:21,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:54:21,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:54:20" (2/3) ... [2018-11-10 01:54:21,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ac72564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:54:21, skipping insertion in model container [2018-11-10 01:54:21,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:54:21,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:21" (3/3) ... [2018-11-10 01:54:21,415 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label59_false-unreach-call_false-termination.c [2018-11-10 01:54:21,447 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:54:21,447 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:54:21,447 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:54:21,447 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:54:21,448 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:54:21,448 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:54:21,448 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:54:21,448 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:54:21,448 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:54:21,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 01:54:21,484 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 01:54:21,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:21,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:21,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:21,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 01:54:21,491 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:54:21,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 01:54:21,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 01:54:21,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:21,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:21,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:21,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 01:54:21,502 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 01:54:21,503 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 01:54:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 01:54:21,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:21,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 01:54:21,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 01:54:21,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:21,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:21,672 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 01:54:21,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:54:21,774 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:54:21,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:54:21,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:54:21,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:54:21,776 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:54:21,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:21,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:54:21,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:54:21,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 01:54:21,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:54:21,777 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:54:21,792 INFO 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 01:54:21,797 INFO 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 01:54:21,818 INFO 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 01:54:21,821 INFO 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 01:54:21,826 INFO 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 01:54:21,829 INFO 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 01:54:21,830 INFO 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 01:54:21,836 INFO 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 01:54:22,003 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:54:22,003 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,036 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,036 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,043 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,050 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,050 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:22,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,086 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,086 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:22,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,095 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,095 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,149 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,149 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,157 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,157 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,176 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,182 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:22,182 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:22,207 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:22,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:54:22,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:22,278 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:54:22,280 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:54:22,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:54:22,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:54:22,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:54:22,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:54:22,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:22,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:54:22,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:54:22,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 01:54:22,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:54:22,281 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:54:22,283 INFO 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 01:54:22,302 INFO 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 01:54:22,305 INFO 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 01:54:22,327 INFO 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 01:54:22,333 INFO 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 01:54:22,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:22,341 INFO 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 01:54:22,342 INFO 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 01:54:22,487 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:54:22,490 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:54:22,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,512 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:22,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:22,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:22,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,564 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 01:54:22,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,568 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,582 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,583 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,587 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,591 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 01:54:22,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,620 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,623 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,626 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:22,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,631 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,631 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 01:54:22,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,644 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,648 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,668 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:22,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,682 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,697 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,697 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:22,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,706 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 01:54:22,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,708 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,709 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,716 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,721 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,721 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,723 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 01:54:22,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,735 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,735 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,740 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,745 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,748 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,748 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:22,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,750 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,751 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:22,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,755 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 01:54:22,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,756 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,757 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,770 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,771 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,774 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,775 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,776 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 01:54:22,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,805 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,805 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,809 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,809 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,809 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,813 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,813 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:22,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,818 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,818 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:22,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:22,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,824 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 01:54:22,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 01:54:22,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,825 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,838 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,842 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,843 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,845 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:22,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,866 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,868 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,872 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,877 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,881 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,885 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:22,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:22,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,892 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 01:54:22,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,893 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,895 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,904 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,909 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,909 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,912 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 01:54:22,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,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 01:54:22,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,946 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,951 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,952 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,957 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:22,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,959 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:22,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,959 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:22,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:22,961 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:22,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,967 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 01:54:22,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,969 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,977 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,979 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,982 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:22,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,983 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:22,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:22,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:22,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:22,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:22,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:22,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:22,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:22,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:22,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:22,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:22,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:23,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:23,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:23,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:23,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:23,005 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:23,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:23,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:23,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:23,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:23,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,015 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:23,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:23,016 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:23,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,021 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 01:54:23,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,021 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,022 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,045 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,046 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,050 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 01:54:23,050 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,053 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 01:54:23,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,108 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,118 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,118 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,120 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,127 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:23,128 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:23,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:23,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:23,132 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:23,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:23,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:23,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:23,133 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:23,134 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:23,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:23,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:23,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:23,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:23,151 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 01:54:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:23,627 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 01:54:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:23,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 01:54:23,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 01:54:23,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 01:54:23,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 01:54:23,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 01:54:23,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 01:54:23,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:23,640 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 01:54:23,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 01:54:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 01:54:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 01:54:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 01:54:23,667 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 01:54:23,667 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 01:54:23,667 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:54:23,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 01:54:23,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 01:54:23,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:23,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:23,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:23,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:23,671 INFO L793 eck$LassoCheckResult]: Stem: 752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 01:54:23,671 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 978#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 977#L611 assume !((((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; 886#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); 887#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 761#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); 696#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 697#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); 853#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 01:54:23,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 01:54:23,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:23,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:23,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:23,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 01:54:23,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:23,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 01:54:23,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:23,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:23,707 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 01:54:23,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:23,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:54:23,798 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:54:23,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:54:23,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:54:23,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:54:23,799 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:54:23,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:23,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:54:23,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:54:23,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 01:54:23,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:54:23,799 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:54:23,800 INFO 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 01:54:23,801 INFO 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 01:54:23,804 INFO 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 01:54:23,806 INFO 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 01:54:23,808 INFO 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 01:54:23,810 INFO 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 01:54:23,814 INFO 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 01:54:23,819 INFO 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 01:54:23,918 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:54:23,918 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:23,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:23,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:23,940 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:23,940 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:23,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:23,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:23,946 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:23,946 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:23,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:23,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:23,969 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:23,970 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:24,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:24,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:24,005 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:24,005 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:24,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:24,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:24,059 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:24,059 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:24,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:24,064 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:24,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:54:24,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:24,124 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 01:54:24,126 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:54:24,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:54:24,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:54:24,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:54:24,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:54:24,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:24,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:54:24,126 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:54:24,126 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 01:54:24,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:54:24,127 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:54:24,128 INFO 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 01:54:24,157 INFO 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 01:54:24,166 INFO 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 01:54:24,169 INFO 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 01:54:24,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:24,182 INFO 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 01:54:24,187 INFO 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 01:54:24,201 INFO 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 01:54:24,351 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:54:24,351 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:54:24,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:24,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:24,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:24,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:24,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,363 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,363 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,368 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:54:24,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:54:24,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,373 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 01:54:24,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,375 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,376 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,377 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,389 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,389 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,391 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,393 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,393 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,396 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,401 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,404 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 01:54:24,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,405 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,408 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,411 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,412 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,413 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,415 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,415 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,417 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,422 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,422 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,423 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,432 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,436 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 01:54:24,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,437 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,437 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,440 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,443 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,443 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,444 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,445 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,446 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,448 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,448 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,450 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,450 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,451 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,454 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,454 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,455 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:54:24,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,460 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,461 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,472 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 01:54:24,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,472 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,473 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,473 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,476 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,476 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,476 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,483 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,484 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,484 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,486 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,489 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,490 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,495 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,495 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,502 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,502 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,503 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 01:54:24,503 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 01:54:24,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,507 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 01:54:24,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,508 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,512 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,513 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,517 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,518 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,518 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,518 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,520 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,522 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,526 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,526 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,527 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,528 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,534 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,536 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,548 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 01:54:24,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,549 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,555 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 01:54:24,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,556 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,556 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,557 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,568 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,569 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,569 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,569 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,579 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,581 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,582 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,583 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,584 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,584 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,588 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,589 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,591 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,599 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,600 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,602 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 01:54:24,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,623 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 01:54:24,625 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 01:54:24,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,634 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 01:54:24,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 01:54:24,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,634 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,641 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,642 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,644 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,646 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,649 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,649 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,654 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,655 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 01:54:24,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,661 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 01:54:24,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 01:54:24,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 01:54:24,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,667 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 01:54:24,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,668 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,672 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,672 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,679 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,679 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,680 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:24,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,682 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,682 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,686 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,689 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,689 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,689 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,690 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:24,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:54:24,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,698 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,698 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 01:54:24,698 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,699 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 01:54:24,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,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 01:54:24,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 01:54:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 01:54:24,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:54:24,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:54:24,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:54:24,718 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 01:54:24,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:54:24,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:54:24,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:54:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:24,737 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 01:54:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:25,162 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 01:54:25,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:25,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 01:54:25,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 01:54:25,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 01:54:25,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 01:54:25,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 01:54:25,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 01:54:25,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:25,173 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 01:54:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 01:54:25,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 01:54:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 01:54:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 01:54:25,191 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 01:54:25,191 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 01:54:25,191 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:54:25,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 01:54:25,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 01:54:25,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:25,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:25,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:25,197 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 01:54:25,197 INFO L793 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 01:54:25,198 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1909#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); 1937#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2290#L606-3 assume true; 2289#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2288#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; 2287#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); 2286#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2277#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); 2276#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2275#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); 2274#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2273#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)); 2272#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); 2183#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); 2180#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); 2179#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2178#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); 2175#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2174#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2173#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2172#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); 2171#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); 2169#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2167#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); 2166#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2135#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2136#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2152#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2150#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); 2148#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); 2144#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2145#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2161#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2138#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2139#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); 1746#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 1747#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 1777#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 1703#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); 1704#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 1877#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2122#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); 2123#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2159#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); 2158#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); 2157#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2156#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); 2155#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2154#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2153#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)); 2151#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); 2149#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; 1673#L606-3 [2018-11-10 01:54:25,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:25,198 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 01:54:25,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:25,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:25,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:25,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:25,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 01:54:25,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:25,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:25,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:25,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:25,282 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 01:54:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:54:25,282 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:54:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:54:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:54:25,283 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 01:54:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:26,132 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-10 01:54:26,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:54:26,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-10 01:54:26,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 01:54:26,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-10 01:54:26,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 01:54:26,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 01:54:26,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-10 01:54:26,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:26,145 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-10 01:54:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-10 01:54:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 01:54:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 01:54:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-10 01:54:26,160 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 01:54:26,160 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 01:54:26,160 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 01:54:26,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-10 01:54:26,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 01:54:26,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:26,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:26,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:26,167 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 01:54:26,167 INFO L793 eck$LassoCheckResult]: Stem: 3696#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 01:54:26,167 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4578#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4577#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; 4576#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); 4575#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4574#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); 4573#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4572#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); 4571#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; 3581#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4746#L606-3 assume true; 4745#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4744#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; 4743#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; 3717#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3828#L606-3 assume true; 3821#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3675#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; 3676#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); 3900#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 3901#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); 4384#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4383#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); 4382#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4380#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)); 4378#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); 4376#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); 4374#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); 4372#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4370#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); 4368#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4366#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4364#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4362#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); 4360#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); 4358#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4356#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); 4354#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4352#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4349#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); 4348#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4346#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); 4345#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); 4344#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4343#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4341#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4340#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4338#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); 4336#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4334#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4332#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4330#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); 4328#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4326#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4324#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); 4323#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4322#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); 4320#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); 4318#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4316#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); 4314#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4312#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4310#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)); 4308#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); 4305#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; 4306#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 01:54:26,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 01:54:26,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:26,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:26,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 01:54:26,172 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:26,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:26,253 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 01:54:26,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:26,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:54:26,254 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:54:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:26,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:26,254 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-10 01:54:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:26,678 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-10 01:54:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:26,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-10 01:54:26,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 01:54:26,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-10 01:54:26,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 01:54:26,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 01:54:26,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-10 01:54:26,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:26,695 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-10 01:54:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-10 01:54:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 01:54:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 01:54:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-10 01:54:26,715 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 01:54:26,715 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 01:54:26,715 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 01:54:26,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-10 01:54:26,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 01:54:26,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:26,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:26,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:26,722 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 01:54:26,723 INFO L793 eck$LassoCheckResult]: Stem: 6436#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 01:54:26,723 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7801#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7800#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; 7799#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); 7798#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7797#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); 7795#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7793#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); 7792#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7790#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)); 6319#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6311#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6312#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6565#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6598#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); 7775#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6510#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6437#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6438#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; 6544#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6909#L606-3 assume true; 6907#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6905#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; 6903#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; 6457#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7421#L606-3 assume true; 7419#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7417#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; 7415#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); 7408#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7093#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); 7094#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7632#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); 7631#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7629#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)); 7627#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); 7625#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); 7624#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); 7623#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7621#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); 7619#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7615#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7609#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7603#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); 7597#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); 7564#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7563#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); 7544#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6914#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6915#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); 7430#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7499#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); 7494#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); 7413#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7414#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7074#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7075#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7361#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); 7087#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7088#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7425#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7426#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); 7277#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7275#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7273#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); 7271#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7268#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); 7265#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); 7262#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7259#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); 7256#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7253#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7250#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)); 7247#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); 7245#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; 7244#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 01:54:26,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:26,723 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 01:54:26,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:26,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:26,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:26,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:26,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:26,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 01:54:26,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:26,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:26,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:26,752 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 01:54:26,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:54:26,752 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:54:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:26,753 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-10 01:54:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:27,208 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 01:54:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:27,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 01:54:27,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 01:54:27,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 01:54:27,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 01:54:27,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 01:54:27,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 01:54:27,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:27,223 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 01:54:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 01:54:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 01:54:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 01:54:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 01:54:27,241 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 01:54:27,241 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 01:54:27,241 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 01:54:27,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 01:54:27,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 01:54:27,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:27,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:27,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:27,248 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 01:54:27,248 INFO L793 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 01:54:27,248 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 9575#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9431#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; 9432#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); 9600#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10192#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); 10365#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10364#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); 10362#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10360#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)); 10358#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); 10356#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); 10354#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); 10352#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10350#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); 10348#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10346#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10344#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10333#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); 9589#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); 9399#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9400#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); 9620#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10613#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10608#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); 10603#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10599#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); 10595#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); 10588#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9784#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; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9778#L606-3 assume true; 9776#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9774#L611 assume !((((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; 9772#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); 9770#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9768#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); 9766#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9764#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); 9762#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9760#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)); 9758#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); 9756#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); 9754#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); 9752#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9750#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); 9748#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9746#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9744#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9742#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); 9740#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); 9738#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9736#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); 9734#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9732#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9730#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); 9728#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9726#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); 9724#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); 9721#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9719#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9717#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9715#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9713#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); 9711#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9709#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9707#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9705#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); 9703#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9701#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9699#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); 9697#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9695#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); 9693#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); 9691#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9689#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); 9687#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9685#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9683#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)); 9681#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9679#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9476#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 01:54:27,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:27,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 01:54:27,249 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:27,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:27,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:27,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 01:54:27,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:27,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:54:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:27,303 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 01:54:27,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:27,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:54:27,304 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:54:27,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:54:27,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:54:27,304 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 01:54:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:27,531 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 01:54:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:54:27,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 01:54:27,538 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 01:54:27,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 01:54:27,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 01:54:27,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 01:54:27,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 01:54:27,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:27,546 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 01:54:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 01:54:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 01:54:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 01:54:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 01:54:27,563 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 01:54:27,563 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 01:54:27,563 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 01:54:27,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 01:54:27,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 01:54:27,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:27,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:27,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:54:27,568 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 01:54:27,569 INFO L793 eck$LassoCheckResult]: Stem: 12457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 01:54:27,570 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13355#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13353#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; 13352#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); 13350#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13349#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); 13348#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13347#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); 13345#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13343#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)); 13337#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); 13336#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); 13334#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); 13332#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13330#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); 13328#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13326#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13324#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13322#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); 13320#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); 13318#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13316#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); 13314#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13312#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13310#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); 13308#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13306#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); 13304#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); 13302#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13300#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13298#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13296#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13294#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); 13292#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13290#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13288#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13286#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); 13284#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13282#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13280#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); 13278#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13276#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); 13274#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); 13272#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13270#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); 13268#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13266#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13264#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)); 13262#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); 13260#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); 13258#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13256#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); 13254#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13252#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13250#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); 13248#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); 13246#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13244#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13242#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); 13240#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13238#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); 13236#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); 13234#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13232#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)); 13230#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13228#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); 13226#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13224#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)); 13222#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13220#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13218#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13216#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)); 13214#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13212#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)); 13210#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13208#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13206#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13204#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); 13202#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13200#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13198#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13196#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13194#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13192#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13190#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13188#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13186#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); 13183#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13181#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13179#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13177#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13175#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13173#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13171#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13169#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13167#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13164#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13162#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13160#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13158#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13156#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13154#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13152#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13150#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13148#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13146#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13145#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13144#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13142#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13140#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13138#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13137#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12489#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13410#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13408#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13406#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13404#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13402#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13400#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13398#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13396#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13394#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13392#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13390#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13388#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13386#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13384#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13382#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13380#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13378#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13376#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13374#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13372#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13370#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13368#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13366#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13364#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13362#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13360#L594-1 calculate_output_#res := -2; 13358#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 01:54:27,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 01:54:27,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 01:54:27,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:27,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:27,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:27,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 01:54:27,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:27,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:27,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:54:28,020 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 01:54:28,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:54:28,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:54:28,654 WARN L179 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 01:54:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 01:54:28,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:54:28,741 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 01:54:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:54:29,479 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 01:54:29,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:54:29,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 01:54:29,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 01:54:29,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 01:54:29,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 01:54:29,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 01:54:29,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 01:54:29,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:54:29,492 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 01:54:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 01:54:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 01:54:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 01:54:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 01:54:29,507 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 01:54:29,507 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 01:54:29,507 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 01:54:29,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 01:54:29,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 01:54:29,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:54:29,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:54:29,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:29,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:54:29,513 INFO L793 eck$LassoCheckResult]: Stem: 15664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16924#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16922#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; 16920#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); 16294#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; 15806#L597 [2018-11-10 01:54:29,513 INFO L795 eck$LassoCheckResult]: Loop: 15806#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16270#L606-3 assume true; 16268#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16266#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; 16264#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); 16262#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16260#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); 16258#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16256#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; 15806#L597 [2018-11-10 01:54:29,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 01:54:29,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:29,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 01:54:29,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:54:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 01:54:29,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:54:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:54:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:54:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:54:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:54:29,725 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:54:29,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:54:29,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:54:29,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:54:29,725 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 01:54:29,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:54:29,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:54:29,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:54:29,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 01:54:29,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:54:29,725 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:54:29,727 INFO 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 01:54:29,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:29,732 INFO 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 01:54:29,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:29,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:29,736 INFO 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 01:54:29,738 INFO 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 01:54:29,739 INFO 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 01:54:29,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:54:29,742 INFO 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 01:54:29,743 INFO 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 01:54:29,745 INFO 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 01:54:29,746 INFO 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 01:54:29,747 INFO 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 01:54:29,749 INFO 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 01:54:29,750 INFO 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 01:54:29,756 INFO 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 01:54:29,757 INFO 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 01:54:29,763 INFO 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 01:54:29,765 INFO 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 01:54:29,766 INFO 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 01:54:29,879 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:54:29,879 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,883 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,886 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,886 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,918 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,918 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,925 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,925 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,944 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,944 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,963 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,963 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:29,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:29,980 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:29,996 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:29,997 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,002 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,002 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,034 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,034 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,054 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,054 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,059 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,059 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,090 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,091 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,109 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,109 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,115 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,115 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,133 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,133 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,166 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,166 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,169 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,189 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:54:30,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,384 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,385 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,406 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,406 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,422 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 01:54:30,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,588 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,588 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,622 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,622 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,627 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,627 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_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/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 01:54:30,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 01:54:30,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 01:54:30,645 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 01:54:30,645 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 01:54:30,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:54:30 BoogieIcfgContainer [2018-11-10 01:54:30,684 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:54:30,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:54:30,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:54:30,685 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:54:30,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:54:21" (3/4) ... [2018-11-10 01:54:30,691 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 01:54:30,727 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ed9c0ce6-c9f5-4f77-bb8c-298ffc8c0e21/bin-2019/uautomizer/witness.graphml [2018-11-10 01:54:30,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:54:30,728 INFO L168 Benchmark]: Toolchain (without parser) took 10603.89 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -104.5 MB). Peak memory consumption was 359.5 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,729 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:54:30,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 916.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 916.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,730 INFO L168 Benchmark]: Boogie Preprocessor took 41.25 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: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,730 INFO L168 Benchmark]: RCFGBuilder took 789.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,730 INFO L168 Benchmark]: BuchiAutomizer took 9275.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 998.2 MB in the beginning and 1.1 GB in the end (delta: -57.9 MB). Peak memory consumption was 539.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:54:30,731 INFO L168 Benchmark]: Witness Printer took 42.98 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: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 01:54:30,732 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 916.8 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 98.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 916.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.25 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: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 789.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 111.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9275.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 338.7 MB). Free memory was 998.2 MB in the beginning and 1.1 GB in the end (delta: -57.9 MB). Peak memory consumption was 539.7 MB. Max. memory is 11.5 GB. * Witness Printer took 42.98 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: 24 B). Peak memory consumption was 24 B. 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.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. 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: 1469 SDtfs, 3081 SDslu, 489 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: 54ms 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@496c8473=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b070c16=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@496c8473=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b070c16=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@496c8473=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@4b070c16=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...