./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5d27e813284518a11dcc3cc5ae3d66f549ea677 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:33:29,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:33:29,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:33:29,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:33:29,494 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:33:29,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:33:29,495 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:33:29,496 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:33:29,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:33:29,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:33:29,499 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:33:29,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:33:29,499 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:33:29,500 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:33:29,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:33:29,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:33:29,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:33:29,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:33:29,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:33:29,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:33:29,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:33:29,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:33:29,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:33:29,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:33:29,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:33:29,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:33:29,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:33:29,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:33:29,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:33:29,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:33:29,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:33:29,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:33:29,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:33:29,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:33:29,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:33:29,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:33:29,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 09:33:29,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:33:29,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:33:29,524 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:33:29,525 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:33:29,525 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:33:29,526 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:33:29,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:33:29,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:33:29,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:33:29,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:33:29,528 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:33:29,528 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:33:29,528 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:33:29,528 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:33:29,529 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:33:29,529 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_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5d27e813284518a11dcc3cc5ae3d66f549ea677 [2018-11-18 09:33:29,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:33:29,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:33:29,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:33:29,565 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:33:29,566 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:33:29,566 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-18 09:33:29,609 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/data/885774f4a/cdb1fd8b885442fd94adc08e4ec4727c/FLAG8c80570be [2018-11-18 09:33:30,062 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:33:30,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/sv-benchmarks/c/eca-rers2012/Problem02_label16_false-unreach-call_false-termination.c [2018-11-18 09:33:30,071 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/data/885774f4a/cdb1fd8b885442fd94adc08e4ec4727c/FLAG8c80570be [2018-11-18 09:33:30,084 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/data/885774f4a/cdb1fd8b885442fd94adc08e4ec4727c [2018-11-18 09:33:30,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:33:30,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:33:30,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:33:30,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:33:30,091 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:33:30,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30, skipping insertion in model container [2018-11-18 09:33:30,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:33:30,138 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:33:30,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:33:30,368 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:33:30,431 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:33:30,443 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:33:30,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30 WrapperNode [2018-11-18 09:33:30,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:33:30,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:33:30,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:33:30,444 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:33:30,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:33:30,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:33:30,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:33:30,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:33:30,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... [2018-11-18 09:33:30,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:33:30,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:33:30,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:33:30,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:33:30,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 09:33:30,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:33:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:33:31,408 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:33:31,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:31 BoogieIcfgContainer [2018-11-18 09:33:31,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:33:31,409 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:33:31,409 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:33:31,411 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:33:31,412 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:31,412 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:33:30" (1/3) ... [2018-11-18 09:33:31,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e327ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:33:31, skipping insertion in model container [2018-11-18 09:33:31,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:31,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:33:30" (2/3) ... [2018-11-18 09:33:31,413 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e327ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:33:31, skipping insertion in model container [2018-11-18 09:33:31,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:33:31,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:31" (3/3) ... [2018-11-18 09:33:31,415 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label16_false-unreach-call_false-termination.c [2018-11-18 09:33:31,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:33:31,448 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:33:31,448 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:33:31,449 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:33:31,449 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:33:31,449 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:33:31,449 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:33:31,449 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:33:31,449 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:33:31,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:33:31,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:33:31,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:31,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:31,493 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:31,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:33:31,494 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:33:31,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 09:33:31,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 09:33:31,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:31,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:31,501 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:31,501 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:33:31,507 INFO L794 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-18 09:33:31,507 INFO L796 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 !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);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 ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~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-18 09:33:31,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:33:31,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:31,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:31,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:31,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 09:33:31,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:31,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:31,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:31,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 09:33:31,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:31,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:31,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:31,695 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-18 09:33:31,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:31,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:33:31,819 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-18 09:33:31,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:33:31,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:33:31,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:33:31,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:33:31,854 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:33:31,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:31,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:33:31,854 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:33:31,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:33:31,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:33:31,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:33:31,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:31,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,091 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:33:32,091 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,113 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,151 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,175 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,219 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 09:33:32,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,254 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:32,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,271 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,315 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:32,349 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:32,377 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:32,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:33:32,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:32,435 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:33:32,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:33:32,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:33:32,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:33:32,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:33:32,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:33:32,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:32,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:33:32,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:33:32,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 09:33:32,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:33:32,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:33:32,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:32,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:33:32,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:33:32,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,662 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:32,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:32,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,703 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:32,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:32,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,709 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:33:32,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,711 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,722 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,728 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,732 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:33:32,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,758 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,766 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,772 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:32,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:32,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,780 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:33:32,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,797 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,799 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:32,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,816 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,848 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:32,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:32,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,853 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:33:32,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,863 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,867 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,867 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,869 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:33:32,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,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-18 09:33:32,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,882 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,883 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,887 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,890 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,894 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:32,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:32,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,896 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:32,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:32,897 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:32,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,901 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:33:32,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,902 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,903 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,920 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,920 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,922 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 09:33:32,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,948 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,948 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,954 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,958 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,961 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,961 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,962 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:32,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,963 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:32,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,964 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:32,964 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:32,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:32,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,969 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:33:32,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,970 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:32,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,985 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:32,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:32,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:32,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:32,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:32,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:32,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:32,991 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:32,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:32,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:32,991 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:32,991 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:32,994 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:32,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,022 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,022 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:33,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,024 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,029 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:33,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,030 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,030 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,034 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:33,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,034 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:33,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:33,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,042 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:33,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,043 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:33,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,050 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:33:33,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,051 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,053 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,065 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,070 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:33,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,075 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 09:33:33,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,107 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,108 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,115 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,116 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,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-18 09:33:33,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,121 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,122 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,127 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:33,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:33,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:33,131 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:33,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,140 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:33:33,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,141 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,142 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,142 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,152 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,155 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,155 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,155 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:33,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,156 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:33,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,172 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,172 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,173 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,180 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,183 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:33,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,185 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:33,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,186 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:33,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:33,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:33,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,191 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:33:33,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,193 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,219 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,220 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,224 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 09:33:33,224 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,227 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 09:33:33,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,292 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,300 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,304 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,304 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,308 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:33,308 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:33,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:33,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:33,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:33,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:33,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:33,312 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:33,312 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:33,313 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:33,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:33,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:33:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:33:33,336 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 09:33:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:33,998 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 09:33:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:33:33,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 09:33:34,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 09:33:34,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 09:33:34,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 09:33:34,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 09:33:34,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 09:33:34,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:34,012 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 09:33:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 09:33:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 09:33:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 09:33:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 09:33:34,043 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:33:34,043 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 09:33:34,043 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:33:34,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 09:33:34,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 09:33:34,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:34,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:34,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:34,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:33:34,046 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-18 09:33:34,046 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 967#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 966#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 965#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 964#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 963#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 962#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 961#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 960#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 959#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-18 09:33:34,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 09:33:34,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:34,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:34,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:34,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:34,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 09:33:34,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:34,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:33:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:34,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 09:33:34,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:34,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:34,095 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-18 09:33:34,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:34,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:33:34,181 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:33:34,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:33:34,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:33:34,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:33:34,181 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:33:34,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:34,181 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:33:34,181 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:33:34,181 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:33:34,181 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:33:34,181 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:33:34,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-18 09:33:34,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,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-18 09:33:34,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:33:34,296 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:34,306 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:34,334 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,361 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:34,362 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:34,380 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,401 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:34,401 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:34,418 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:34,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:33:34,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:34,474 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 09:33:34,476 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:33:34,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:33:34,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:33:34,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:33:34,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:33:34,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:34,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:33:34,476 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:33:34,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 09:33:34,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:33:34,476 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:33:34,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:34,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:33:34,718 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:33:34,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:34,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:34,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,725 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:34,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:34,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,736 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,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-18 09:33:34,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,740 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:33:34,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:33:34,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,745 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 09:33:34,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,747 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,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-18 09:33:34,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,749 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,750 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,752 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,754 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,761 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,764 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,767 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,772 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,774 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 09:33:34,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-18 09:33:34,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,786 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,789 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,789 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,797 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,804 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,807 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 09:33:34,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,808 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,811 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,812 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,815 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,815 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,817 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,820 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,821 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,823 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,823 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,823 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,828 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,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-18 09:33:34,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:33:34,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,844 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,847 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 09:33:34,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,848 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,848 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,848 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,852 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,852 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,852 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,857 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,860 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,860 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,861 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,862 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,862 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,863 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,865 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,870 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,871 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,871 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:34,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,878 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:34,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,879 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 09:33:34,880 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 09:33:34,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,887 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 09:33:34,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,888 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,889 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,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-18 09:33:34,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,893 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,894 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,898 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,903 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,904 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,906 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,909 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,910 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,911 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,916 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,917 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,918 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:34,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,928 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 09:33:34,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:34,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:34,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,935 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 09:33:34,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,936 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,936 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,942 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,947 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,947 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,948 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,949 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,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-18 09:33:34,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,950 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,953 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,958 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,959 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,969 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,969 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:34,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,972 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 09:33:34,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:34,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:34,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:34,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:34,992 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:34,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:34,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:34,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:34,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 09:33:34,994 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 09:33:34,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,002 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 09:33:35,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-18 09:33:35,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:35,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,005 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,006 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:35,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,009 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,010 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:35,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,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-18 09:33:35,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,012 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:35,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,014 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,014 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,014 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:35,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,016 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,017 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:35,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,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-18 09:33:35,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,021 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,022 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:33:35,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 09:33:35,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 09:33:35,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 09:33:35,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,034 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 09:33:35,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,035 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:35,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,038 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,039 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:35,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,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-18 09:33:35,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,045 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,046 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,046 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,046 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:35,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,049 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:35,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,052 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,052 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:35,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,055 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,056 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:35,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,063 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,063 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 09:33:35,063 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,065 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 09:33:35,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:33:35,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 09:33:35,083 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 09:33:35,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:33:35,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:33:35,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:33:35,083 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 09:33:35,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:33:35,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:33:35,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:33:35,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:33:35,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:33:35,102 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 09:33:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:35,568 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-18 09:33:35,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:33:35,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-18 09:33:35,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:33:35,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 09:33:35,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 09:33:35,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 09:33:35,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-18 09:33:35,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:35,581 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:33:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-18 09:33:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 09:33:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 09:33:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-18 09:33:35,598 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:33:35,598 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-18 09:33:35,598 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:33:35,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-18 09:33:35,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 09:33:35,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:35,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:35,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:35,603 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-18 09:33:35,603 INFO L794 eck$LassoCheckResult]: Stem: 1794#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-18 09:33:35,604 INFO L796 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1902#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1775#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1930#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2152#L606-3 assume true; 2150#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2146#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2144#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2142#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 2140#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2138#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 2136#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2134#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 2132#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 2130#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 2128#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 2126#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2124#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2122#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2120#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2052#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2053#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 2304#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 2301#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2299#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 2297#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2050#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2051#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 2156#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2315#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 2314#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 2061#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2062#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2112#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2054#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2055#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 2163#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2164#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2167#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2169#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 2170#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1777#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1707#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2172#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 2173#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 2175#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2293#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 2291#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2289#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2287#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 2285#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 2283#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1818#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-18 09:33:35,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 09:33:35,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:35,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:35,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 09:33:35,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:35,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:35,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:33:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:35,684 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-18 09:33:35,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:35,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:33:35,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:33:35,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:33:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:33:35,685 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-18 09:33:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:36,468 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-18 09:33:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:33:36,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-18 09:33:36,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 09:33:36,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-18 09:33:36,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 09:33:36,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 09:33:36,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-18 09:33:36,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:36,481 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-18 09:33:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-18 09:33:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 09:33:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 09:33:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-18 09:33:36,495 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 09:33:36,495 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-18 09:33:36,495 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:33:36,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-18 09:33:36,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 09:33:36,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:36,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:36,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:36,502 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-18 09:33:36,502 INFO L794 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 09:33:36,503 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4436#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4434#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4432#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4430#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4428#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4426#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4424#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4423#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3750#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4389#L606-3 assume true; 4387#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4386#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4339#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3792#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4328#L606-3 assume true; 4202#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4191#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4190#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4188#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4186#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4184#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4182#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4180#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4178#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 4176#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 4174#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 4172#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 4170#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4168#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4166#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4164#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4162#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4160#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 4158#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 4156#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4154#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 4152#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4150#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4148#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 4146#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4144#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 4142#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 4140#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4138#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4136#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4134#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4132#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 4130#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4128#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4126#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4124#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 4122#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4120#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4118#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 4116#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4114#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 4112#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 4110#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4108#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 4106#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4104#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4102#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 4100#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 4097#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4098#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 09:33:36,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 09:33:36,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:36,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:36,509 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 09:33:36,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:36,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:33:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:36,556 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-18 09:33:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:36,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:33:36,557 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:33:36,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:33:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:33:36,557 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-18 09:33:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:36,941 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-18 09:33:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:33:36,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-18 09:33:36,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 09:33:36,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-18 09:33:36,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 09:33:36,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 09:33:36,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-18 09:33:36,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:36,953 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-18 09:33:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-18 09:33:36,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 09:33:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 09:33:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-18 09:33:36,966 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 09:33:36,966 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-18 09:33:36,966 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:33:36,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-18 09:33:36,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:33:36,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:36,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:36,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:36,972 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-18 09:33:36,972 INFO L794 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 09:33:36,972 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7281#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7279#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7277#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7275#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7273#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7271#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7269#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7267#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7265#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7263#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7261#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7259#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7257#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7255#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7253#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7251#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7249#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6938#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6929#L606-3 assume true; 6927#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6925#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6923#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6533#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6930#L606-3 assume true; 6928#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6926#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6924#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6922#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6920#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6918#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6916#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6914#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6912#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6910#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6908#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6906#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6904#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6902#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6900#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6898#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6896#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6894#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6892#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6890#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6888#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6886#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6884#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6882#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6880#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6878#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6876#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6874#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6872#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6870#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6868#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6866#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6864#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6862#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6860#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6858#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6856#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6854#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6852#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6850#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6848#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6846#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6844#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6842#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6840#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6838#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6836#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6833#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6830#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6831#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 09:33:36,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:36,972 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 09:33:36,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:36,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:36,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:36,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:36,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 09:33:36,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:33:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:37,004 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-18 09:33:37,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:37,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:33:37,005 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:33:37,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:33:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:33:37,005 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-18 09:33:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:37,328 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-18 09:33:37,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:33:37,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-18 09:33:37,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:33:37,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 09:33:37,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 09:33:37,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 09:33:37,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-18 09:33:37,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:37,340 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:33:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-18 09:33:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 09:33:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 09:33:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 09:33:37,352 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:33:37,352 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 09:33:37,352 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:33:37,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-18 09:33:37,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 09:33:37,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:37,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:37,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:37,358 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-18 09:33:37,358 INFO L794 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 09:33:37,358 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10507#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10503#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10501#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10499#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10497#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10495#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10488#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10489#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10483#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10484#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10586#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10584#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10582#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10580#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10578#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10577#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9926#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9927#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10192#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10190#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10188#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10186#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10184#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10182#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10180#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10178#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 10176#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9787#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9677#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9780#L606-3 assume true; 9778#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9776#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9774#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9772#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9770#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9768#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9766#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9764#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9762#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9760#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9758#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9756#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9754#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9752#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9750#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9748#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9746#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9744#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9742#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9740#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9738#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9736#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9734#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9732#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 9730#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9728#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 9725#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 9723#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9721#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9719#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9717#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9715#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 9713#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9711#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9709#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9707#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 9705#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9703#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9701#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 9699#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9697#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 9695#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 9693#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9691#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 9689#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9687#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9685#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 9683#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 9679#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 09:33:37,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:37,358 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 09:33:37,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:37,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:37,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 09:33:37,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:33:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:37,415 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-18 09:33:37,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:37,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:33:37,416 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:33:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:33:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:33:37,416 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 09:33:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:37,610 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-18 09:33:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:33:37,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-18 09:33:37,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:33:37,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 09:33:37,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 09:33:37,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 09:33:37,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-18 09:33:37,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:37,623 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:33:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-18 09:33:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 09:33:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 09:33:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 09:33:37,636 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:33:37,636 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 09:33:37,636 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 09:33:37,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-18 09:33:37,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 09:33:37,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:37,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:37,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:33:37,641 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-18 09:33:37,641 INFO L794 eck$LassoCheckResult]: Stem: 12459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 09:33:37,642 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 12563#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 12439#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 12440#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13077#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13078#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13748#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13746#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 13744#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13745#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12349#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 12350#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 13810#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 13808#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13806#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13804#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13802#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13800#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13798#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 13796#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 12407#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12408#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 12409#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12410#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13639#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13638#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13637#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13636#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13635#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12847#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12362#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12325#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12326#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12411#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12412#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12441#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12371#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12372#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12442#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12375#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12376#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12425#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12394#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 12395#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 12501#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 12502#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12845#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12846#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13623#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13621#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 13620#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13619#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 13587#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13588#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13634#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12451#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12452#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13697#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13695#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 13693#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13692#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 13690#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 13688#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13686#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13684#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13682#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 13680#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13678#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 13676#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13674#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13672#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13670#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 13668#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13666#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 13664#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13662#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13660#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13658#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 13656#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13654#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13652#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13650#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13648#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13646#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13644#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13642#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13640#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12357#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12556#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12387#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12388#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12358#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12359#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13633#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13632#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13630#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13629#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12417#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12418#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12554#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12385#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12386#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12553#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12528#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12497#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12498#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12464#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12465#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12596#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13786#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13785#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13784#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13783#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12347#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12348#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13815#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13814#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13813#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13812#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13811#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13809#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13807#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13805#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13803#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13801#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13799#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13797#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13795#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12486#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12487#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12447#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12448#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12566#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12398#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12399#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12365#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12366#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12329#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12330#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12482#L594-1 calculate_output_#res := -2; 12483#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 09:33:37,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 09:33:37,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:37,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 09:33:37,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:37,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 09:33:37,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:33:38,039 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-18 09:33:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:33:38,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 09:33:38,665 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 09:33:38,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:33:38,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:33:38,726 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 09:33:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:33:39,496 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-18 09:33:39,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:33:39,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-18 09:33:39,504 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 09:33:39,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-18 09:33:39,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 09:33:39,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 09:33:39,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-18 09:33:39,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:33:39,515 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-18 09:33:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-18 09:33:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 09:33:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 09:33:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-18 09:33:39,537 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 09:33:39,537 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 09:33:39,537 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 09:33:39,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-18 09:33:39,543 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 09:33:39,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:33:39,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:33:39,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:33:39,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:33:39,544 INFO L794 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16873#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16871#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16315#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15808#L597 [2018-11-18 09:33:39,545 INFO L796 eck$LassoCheckResult]: Loop: 15808#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16293#L606-3 assume true; 16291#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16289#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16287#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16285#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16283#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 16281#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16279#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 15808#L597 [2018-11-18 09:33:39,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 09:33:39,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 09:33:39,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:39,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:33:39,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 09:33:39,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:33:39,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:33:39,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:33:39,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:33:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:33:39,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:33:39,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:33:39,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:33:39,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:33:39,761 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 09:33:39,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:33:39,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:33:39,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:33:39,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label16_false-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 09:33:39,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:33:39,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:33:39,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-18 09:33:39,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-18 09:33:39,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-18 09:33:39,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:33:39,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-18 09:33:39,925 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:33:39,925 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:39,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:39,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:39,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:39,930 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:39,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:39,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:39,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:39,949 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:39,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:39,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:39,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:39,968 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:39,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:39,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:39,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:39,985 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,004 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,021 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,040 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,055 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,055 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,058 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,078 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,078 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,096 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,096 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,115 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,132 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,151 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,169 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,187 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,187 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,203 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,203 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:33:40,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,385 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,385 INFO L448 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=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {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}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,404 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,421 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 09:33:40,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,576 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,576 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,594 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,594 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,612 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,612 INFO L448 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_70406031-7ed3-4418-b68d-cdfca3133992/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-18 09:33:40,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 09:33:40,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 09:33:40,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 09:33:40,630 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 09:33:40,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:33:40 BoogieIcfgContainer [2018-11-18 09:33:40,666 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:33:40,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:33:40,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:33:40,666 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:33:40,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:33:31" (3/4) ... [2018-11-18 09:33:40,669 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 09:33:40,711 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_70406031-7ed3-4418-b68d-cdfca3133992/bin-2019/uautomizer/witness.graphml [2018-11-18 09:33:40,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:33:40,711 INFO L168 Benchmark]: Toolchain (without parser) took 10624.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 956.5 MB in the beginning and 1.1 GB in the end (delta: -105.7 MB). Peak memory consumption was 367.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,712 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:33:40,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.68 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,713 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,713 INFO L168 Benchmark]: RCFGBuilder took 825.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,713 INFO L168 Benchmark]: BuchiAutomizer took 9256.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.1 MB). Peak memory consumption was 524.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:33:40,714 INFO L168 Benchmark]: Witness Printer took 44.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:33:40,715 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.68 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.7 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -216.5 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.19 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 825.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9256.95 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 324.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.1 MB). Peak memory consumption was 524.2 MB. Max. memory is 11.5 GB. * Witness Printer took 44.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 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, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 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: 67ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - 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@7ed1861d=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f027d25=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@7ed1861d=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f027d25=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@7ed1861d=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@3f027d25=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 -6*0^k + 1*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 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 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...