./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 11:42:04,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:42:04,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:42:04,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:42:04,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:42:04,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:42:04,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:42:04,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:42:04,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:42:04,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:42:04,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:42:04,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:42:04,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:42:04,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:42:04,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:42:04,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:42:04,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:42:04,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:42:04,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:42:04,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:42:04,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:42:04,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:42:04,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:42:04,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:42:04,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:42:04,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:42:04,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:42:04,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:42:04,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:42:04,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:42:04,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:42:04,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:42:04,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:42:04,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:42:04,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:42:04,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:42:04,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:42:04,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:42:04,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:42:04,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:42:04,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:42:04,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:42:04,546 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:42:04,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:42:04,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:42:04,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:42:04,548 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:42:04,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:42:04,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:42:04,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:42:04,549 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:42:04,549 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2018-11-18 11:42:04,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:42:04,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:42:04,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:42:04,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:42:04,580 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:42:04,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-18 11:42:04,614 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/data/530ac0b26/9a45dfe53772470b9909b240dc8cbf77/FLAGeaa8f990b [2018-11-18 11:42:05,060 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:42:05,061 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-18 11:42:05,069 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/data/530ac0b26/9a45dfe53772470b9909b240dc8cbf77/FLAGeaa8f990b [2018-11-18 11:42:05,081 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/data/530ac0b26/9a45dfe53772470b9909b240dc8cbf77 [2018-11-18 11:42:05,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:42:05,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:42:05,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:42:05,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:42:05,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:42:05,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,091 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 11:42:05, skipping insertion in model container [2018-11-18 11:42:05,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:42:05,132 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:42:05,382 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:42:05,385 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:42:05,449 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:42:05,461 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:42:05,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05 WrapperNode [2018-11-18 11:42:05,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:42:05,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:42:05,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:42:05,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:42:05,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:42:05,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:42:05,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:42:05,565 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:42:05,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... [2018-11-18 11:42:05,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:42:05,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:42:05,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:42:05,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:42:05,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:42:05,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:42:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:42:06,413 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:42:06,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:42:06 BoogieIcfgContainer [2018-11-18 11:42:06,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:42:06,414 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:42:06,414 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:42:06,416 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:42:06,417 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:42:06,417 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:42:05" (1/3) ... [2018-11-18 11:42:06,418 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 11:42:06, skipping insertion in model container [2018-11-18 11:42:06,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:42:06,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:42:05" (2/3) ... [2018-11-18 11:42:06,419 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 11:42:06, skipping insertion in model container [2018-11-18 11:42:06,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:42:06,419 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:42:06" (3/3) ... [2018-11-18 11:42:06,420 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-18 11:42:06,453 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:42:06,453 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:42:06,453 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:42:06,453 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:42:06,454 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:42:06,454 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:42:06,454 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:42:06,454 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:42:06,454 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:42:06,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:42:06,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:42:06,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:06,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:06,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:06,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:42:06,496 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:42:06,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:42:06,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:42:06,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:06,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:06,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:06,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:42:06,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 11:42:06,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 11:42:06,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 11:42:06,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:06,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:06,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 11:42:06,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:06,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 11:42:06,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:42:06,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:06,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:42:06,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:42:06,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:42:06,813 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:42:06,813 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:42:06,813 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:42:06,813 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:06,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:42:06,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:42:06,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:42:06,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:42:06,814 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:42:06,834 INFO 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 11:42:06,843 INFO 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 11:42:06,895 INFO 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 11:42:06,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:06,911 INFO 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 11:42:06,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 11:42:06,929 INFO 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 11:42:06,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:07,159 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 11:42:07,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:42:07,204 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,216 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,216 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,261 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,261 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,313 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,313 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,347 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,347 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:07,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,381 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,381 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,408 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:07,437 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:07,453 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:07,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:42:07,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:07,517 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:42:07,518 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:42:07,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:42:07,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:42:07,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:42:07,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:42:07,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:07,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:42:07,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:42:07,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:42:07,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:42:07,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:42:07,522 INFO 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 11:42:07,533 INFO 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 11:42:07,534 INFO 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 11:42:07,553 INFO 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 11:42:07,556 INFO 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 11:42:07,558 INFO 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 11:42:07,560 INFO 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 11:42:07,562 INFO 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 11:42:07,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:42:07,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:42:07,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 11:42:07,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,745 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:07,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:07,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:07,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:07,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:07,782 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,787 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:42:07,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,789 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,798 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,802 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:07,802 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,804 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:42:07,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,822 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,826 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,827 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,831 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,834 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,836 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:07,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:07,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,842 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:42:07,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 11:42:07,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,843 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,858 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:07,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,860 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:07,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,886 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,887 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:07,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:07,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:07,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:07,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,898 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:42:07,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,908 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,913 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:07,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,915 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:42:07,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,930 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,931 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,935 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,936 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,939 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,942 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,943 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:07,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:07,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:07,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:07,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:07,945 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:07,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,949 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:42:07,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 11:42:07,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:07,950 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:07,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:07,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:07,965 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:07,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:07,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:07,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,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 11:42:07,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:07,969 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:07,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:07,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:07,970 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:07,971 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:07,973 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:42:07,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:07,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:07,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,001 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:08,002 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:08,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:08,007 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:08,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:08,011 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:08,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:08,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:08,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:08,017 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:08,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,023 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:42:08,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,024 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,044 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,044 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:08,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,047 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:08,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,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 11:42:08,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,070 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,070 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,071 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,076 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,081 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,081 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,086 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,088 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:08,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,089 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:08,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,090 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:08,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,096 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:42:08,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,097 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,100 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,109 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,113 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,113 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:08,114 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,117 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:42:08,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,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 11:42:08,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,153 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,158 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,163 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,163 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,164 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:08,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,166 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,166 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:08,166 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:08,168 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:08,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,174 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:42:08,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,176 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,185 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,188 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:08,188 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,189 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:08,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,203 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,216 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:08,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:08,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,219 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:08,219 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:08,220 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:08,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,225 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:42:08,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,226 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,250 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,250 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,254 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:42:08,255 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,257 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 11:42:08,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,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 11:42:08,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,313 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,313 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,324 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,324 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,328 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,329 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:08,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:08,333 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:08,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:08,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:08,337 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:08,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:08,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:08,338 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:08,338 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:08,339 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:08,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:08,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:42:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:42:08,357 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 11:42:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:08,989 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 11:42:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:42:08,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 11:42:08,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 11:42:08,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 11:42:09,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 11:42:09,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 11:42:09,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 11:42:09,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:09,003 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 11:42:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 11:42:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 11:42:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 11:42:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 11:42:09,031 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:42:09,031 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:42:09,031 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:42:09,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 11:42:09,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 11:42:09,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:09,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:09,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:09,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:42:09,035 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; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-18 11:42:09,035 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 866#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 979#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; 884#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); 885#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 760#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); 695#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 696#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); 852#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 634#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; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-18 11:42:09,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 11:42:09,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:09,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:09,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:09,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 11:42:09,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:09,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:42:09,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:09,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 11:42:09,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:09,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:09,069 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 11:42:09,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:09,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:42:09,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:42:09,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:42:09,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:42:09,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:42:09,160 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:42:09,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:09,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:42:09,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:42:09,160 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:42:09,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:42:09,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:42:09,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,165 INFO 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 11:42:09,168 INFO 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 11:42:09,170 INFO 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 11:42:09,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,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 11:42:09,272 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:42:09,272 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,283 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:09,283 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,308 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:09,308 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:09,328 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:09,345 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:09,363 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:09,381 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:09,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:42:09,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:09,420 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:42:09,424 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:42:09,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:42:09,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:42:09,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:42:09,425 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:42:09,425 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:09,425 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:42:09,425 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:42:09,425 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:42:09,425 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:42:09,425 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:42:09,426 INFO 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 11:42:09,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 11:42:09,445 INFO 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 11:42:09,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:42:09,463 INFO 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 11:42:09,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 11:42:09,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:42:09,559 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:42:09,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:09,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:09,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,564 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,564 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:09,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:09,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,567 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,569 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:42:09,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:42:09,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,574 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:42:09,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,575 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,577 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,580 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,580 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,581 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,581 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,583 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,585 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,588 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,588 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,595 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:42:09,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,598 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,601 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,604 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,607 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,607 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,610 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,611 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,619 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:42:09,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,620 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,623 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,623 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,626 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,628 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,630 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,632 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,632 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,633 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,637 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,637 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:42:09,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,644 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,647 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:42:09,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,648 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,648 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,649 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,651 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,652 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,656 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,656 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,657 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,658 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,658 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,660 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,660 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,662 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,667 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,667 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,675 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,675 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:42:09,676 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:42:09,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,679 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:42:09,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,684 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,690 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,691 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,692 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,693 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,699 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,699 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,700 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,708 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,720 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:42:09,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,726 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:42:09,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 11:42:09,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,727 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,728 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,728 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,734 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,735 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,744 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,746 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,747 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,748 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,749 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,750 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,750 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,751 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,756 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,758 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,769 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,769 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,772 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:42:09,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:42:09,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:42:09,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,804 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:42:09,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,808 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,808 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,809 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,813 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,815 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,815 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,819 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,820 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,863 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:42:09,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,871 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,871 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:42:09,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:42:09,872 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:42:09,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,879 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:42:09,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,880 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,883 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,883 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,891 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,891 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,892 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:09,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,894 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,894 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:42:09,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,897 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,900 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,901 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,901 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,902 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:09,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,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 11:42:09,909 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:42:09,910 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,911 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:42:09,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:42:09,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:42:09,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:42:09,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:42:09,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:42:09,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:42:09,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:42:09,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:42:09,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:42:09,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:42:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:42:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:42:09,951 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 11:42:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:10,336 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 11:42:10,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:42:10,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 11:42:10,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:42:10,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 11:42:10,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 11:42:10,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 11:42:10,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 11:42:10,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:10,349 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:42:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 11:42:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 11:42:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 11:42:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 11:42:10,365 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:42:10,365 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:42:10,365 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:42:10,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 11:42:10,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:42:10,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:10,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:10,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:10,368 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 11:42:10,368 INFO L794 eck$LassoCheckResult]: Stem: 1793#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 11:42:10,370 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; 1772#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; 1773#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); 1926#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; 2202#L606-3 assume true; 2200#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2198#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; 2196#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); 2194#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2192#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); 2190#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2188#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); 2186#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2184#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)); 2181#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); 2179#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); 2177#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); 2175#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2173#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); 2171#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2169#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2167#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2165#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); 2163#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); 2161#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2159#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); 2157#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2142#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2143#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); 2153#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2151#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); 2150#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); 2149#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2126#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2125#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2123#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2121#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); 2119#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2117#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2115#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2113#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); 2112#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2111#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2109#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); 2110#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2213#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); 2214#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); 1927#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1836#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); 1837#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1885#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1760#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)); 1761#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); 1762#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; 1779#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 11:42:10,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 11:42:10,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:10,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:10,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:10,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:10,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 11:42:10,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:10,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:10,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:42:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:10,434 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 11:42:10,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:10,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:42:10,435 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:42:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:42:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:42:10,435 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 11:42:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:11,132 INFO L93 Difference]: Finished difference Result 1228 states and 1697 transitions. [2018-11-18 11:42:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:42:11,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1697 transitions. [2018-11-18 11:42:11,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 11:42:11,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1697 transitions. [2018-11-18 11:42:11,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 11:42:11,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 11:42:11,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1697 transitions. [2018-11-18 11:42:11,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:11,142 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1697 transitions. [2018-11-18 11:42:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1697 transitions. [2018-11-18 11:42:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 11:42:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 11:42:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1691 transitions. [2018-11-18 11:42:11,160 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-18 11:42:11,160 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1691 transitions. [2018-11-18 11:42:11,161 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:42:11,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1691 transitions. [2018-11-18 11:42:11,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 11:42:11,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:11,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:11,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:11,165 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 11:42:11,166 INFO L794 eck$LassoCheckResult]: Stem: 3692#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 11:42:11,166 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4655#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4653#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; 4651#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); 4649#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4647#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); 4645#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4643#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); 4641#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; 3590#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4755#L606-3 assume true; 4754#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4753#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; 4752#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; 3671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4767#L606-3 assume true; 4571#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4570#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; 4568#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); 4566#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4564#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); 4562#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4560#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); 4558#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4556#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)); 4554#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); 4552#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); 4550#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); 4548#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4546#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); 4544#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4542#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4529#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4524#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); 4517#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); 4516#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4495#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); 4492#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4207#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4208#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); 4489#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4483#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); 4424#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); 4177#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3670#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3589#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4679#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); 4675#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4537#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4535#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4532#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); 4530#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4525#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4519#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); 4520#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4575#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); 4573#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); 4423#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4422#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); 4421#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4420#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4418#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)); 4416#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); 4414#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; 4073#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 11:42:11,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 11:42:11,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:11,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 11:42:11,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:11,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:42:11,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:11,191 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 11:42:11,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:11,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:42:11,192 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:42:11,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:42:11,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:42:11,192 INFO L87 Difference]: Start difference. First operand 1225 states and 1691 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-18 11:42:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:11,555 INFO L93 Difference]: Finished difference Result 1509 states and 2000 transitions. [2018-11-18 11:42:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:42:11,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2000 transitions. [2018-11-18 11:42:11,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 11:42:11,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2000 transitions. [2018-11-18 11:42:11,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 11:42:11,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 11:42:11,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2000 transitions. [2018-11-18 11:42:11,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:11,567 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2000 transitions. [2018-11-18 11:42:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2000 transitions. [2018-11-18 11:42:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 11:42:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 11:42:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1998 transitions. [2018-11-18 11:42:11,581 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-18 11:42:11,581 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 1998 transitions. [2018-11-18 11:42:11,581 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:42:11,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 1998 transitions. [2018-11-18 11:42:11,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:42:11,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:11,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:11,586 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:11,586 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 11:42:11,587 INFO L794 eck$LassoCheckResult]: Stem: 6436#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 11:42:11,587 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7184#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7175#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; 7174#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); 7172#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7170#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); 7168#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7166#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); 7164#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7162#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)); 7160#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); 7158#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); 7156#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); 7154#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7152#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); 7150#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7148#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7146#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7144#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; 6458#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6566#L606-3 assume true; 6559#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6414#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; 6415#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; 6774#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7455#L606-3 assume true; 7453#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7451#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; 7449#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); 7447#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7445#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); 7443#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7441#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); 7439#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7437#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)); 7435#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); 7433#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); 7431#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); 7429#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7427#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); 7425#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7423#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7421#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7419#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); 7417#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); 7415#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 7412#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); 7413#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 7617#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 7615#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); 7613#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 7611#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); 7609#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); 7605#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 7603#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 7353#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 7182#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 7183#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); 7358#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 7360#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7378#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 7379#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); 7355#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6417#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6418#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); 6593#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6397#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); 6398#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); 7321#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 7319#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); 7317#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 7315#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 7313#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)); 7311#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); 7188#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; 7186#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 11:42:11,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 11:42:11,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:11,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:11,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 11:42:11,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:11,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:42:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:11,618 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 11:42:11,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:11,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:42:11,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:42:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:42:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:42:11,619 INFO L87 Difference]: Start difference. First operand 1508 states and 1998 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-18 11:42:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:11,998 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-18 11:42:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:42:12,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-18 11:42:12,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:42:12,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 11:42:12,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 11:42:12,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 11:42:12,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-18 11:42:12,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:12,017 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 11:42:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-18 11:42:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 11:42:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 11:42:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-18 11:42:12,035 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 11:42:12,035 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-18 11:42:12,035 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:42:12,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-18 11:42:12,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:42:12,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:12,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:12,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:12,042 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 11:42:12,042 INFO L794 eck$LassoCheckResult]: Stem: 9454#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 11:42:12,042 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10672#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10671#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; 10670#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); 10237#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10238#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); 10286#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10285#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); 10279#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10280#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)); 10273#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); 10274#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); 10345#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); 10342#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10341#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); 10340#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10339#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10337#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10329#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); 10330#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); 10627#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10626#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); 10625#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10590#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10585#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); 10579#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10573#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); 10567#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); 10559#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; 9680#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9782#L606-3 assume true; 9780#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9778#L611 assume !((((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; 9776#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); 9774#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9772#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); 9770#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9768#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); 9766#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9764#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)); 9762#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); 9760#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); 9758#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); 9756#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9754#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); 9752#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9750#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9748#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9746#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); 9744#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); 9742#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9740#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); 9738#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9736#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9734#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); 9732#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9730#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); 9728#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); 9725#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9723#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9721#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9719#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9717#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); 9715#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9713#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9711#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9709#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); 9707#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9705#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9703#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); 9701#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9699#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); 9697#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); 9695#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9693#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); 9691#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9689#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9687#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)); 9685#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); 9682#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; 9683#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 11:42:12,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 11:42:12,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:12,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 11:42:12,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:12,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:42:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:12,102 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 11:42:12,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:12,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:42:12,103 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:42:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:42:12,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:42:12,103 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-18 11:42:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:12,294 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-18 11:42:12,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:42:12,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-18 11:42:12,299 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:42:12,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 11:42:12,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 11:42:12,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 11:42:12,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-18 11:42:12,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:12,305 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 11:42:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-18 11:42:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 11:42:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 11:42:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-18 11:42:12,317 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 11:42:12,317 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-18 11:42:12,317 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:42:12,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-18 11:42:12,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:42:12,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:12,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:12,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:42:12,322 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 11:42:12,322 INFO L794 eck$LassoCheckResult]: Stem: 12456#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 11:42:12,324 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13352#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13351#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; 13349#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); 13348#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13347#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); 13346#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13344#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); 13342#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13335#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)); 13334#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); 13332#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); 13330#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); 13328#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13326#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); 13324#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13322#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13320#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13318#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); 13316#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); 13314#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13312#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); 13310#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13308#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13306#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); 13304#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13302#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); 13300#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); 13298#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13296#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13294#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13292#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13290#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); 13288#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13286#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13284#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13282#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); 13280#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13278#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13276#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); 13274#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13272#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); 13270#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); 13268#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13266#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); 13264#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13262#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13260#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)); 13258#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); 13256#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); 13254#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13252#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); 13250#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13248#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13246#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); 13244#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); 13242#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13240#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13238#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); 13236#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13234#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); 13232#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); 13230#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13228#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)); 13226#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13224#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); 13222#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13220#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)); 13218#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13216#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13214#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13212#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)); 13210#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13208#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)); 13206#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13204#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13202#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13200#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); 13198#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13196#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13194#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13192#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13190#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13188#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13186#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13184#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13182#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12354#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13179#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13177#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13175#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13173#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13171#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13169#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13167#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13165#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13163#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13160#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13158#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13156#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13154#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13152#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13150#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13148#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13145#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13143#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13142#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13141#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13139#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13137#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13135#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13134#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13132#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12488#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13407#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13405#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13403#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13401#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13399#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13397#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13395#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13393#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13391#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13389#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13387#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13385#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13383#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13381#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13379#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13377#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13375#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13373#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13371#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13369#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13367#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13365#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13363#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13361#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13359#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13357#L594-1 calculate_output_#res := -2; 13355#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 11:42:12,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 11:42:12,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 11:42:12,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:12,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 11:42:12,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:12,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:12,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:42:12,698 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 11:42:12,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:42:12,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:42:13,346 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 11:42:13,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:42:13,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:42:13,421 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-18 11:42:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:42:14,317 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-18 11:42:14,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:42:14,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-18 11:42:14,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 11:42:14,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-18 11:42:14,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 11:42:14,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 11:42:14,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-18 11:42:14,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:42:14,336 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-18 11:42:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-18 11:42:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 11:42:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 11:42:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-18 11:42:14,355 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 11:42:14,355 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-18 11:42:14,355 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:42:14,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-18 11:42:14,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 11:42:14,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:42:14,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:42:14,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:42:14,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:42:14,362 INFO L794 eck$LassoCheckResult]: Stem: 15664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16900#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16897#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; 16894#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); 16296#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; 15807#L597 [2018-11-18 11:42:14,362 INFO L796 eck$LassoCheckResult]: Loop: 15807#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16272#L606-3 assume true; 16270#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16268#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; 16266#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); 16264#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16262#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); 16260#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16258#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; 15807#L597 [2018-11-18 11:42:14,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:14,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 11:42:14,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:14,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:14,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:14,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 11:42:14,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:14,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:42:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 11:42:14,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:42:14,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:42:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:42:14,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:42:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:42:14,564 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:42:14,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:42:14,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:42:14,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:42:14,564 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:42:14,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:42:14,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:42:14,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:42:14,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label06_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 11:42:14,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:42:14,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:42:14,566 INFO 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 11:42:14,573 INFO 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 11:42:14,575 INFO 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 11:42:14,576 INFO 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 11:42:14,577 INFO 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 11:42:14,579 INFO 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 11:42:14,582 INFO 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 11:42:14,584 INFO 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 11:42:14,586 INFO 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 11:42:14,588 INFO 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 11:42:14,589 INFO 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 11:42:14,591 INFO 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 11:42:14,593 INFO 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 11:42:14,594 INFO 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 11:42:14,596 INFO 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 11:42:14,598 INFO 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 11:42:14,605 INFO 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 11:42:14,609 INFO 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 11:42:14,614 INFO 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 11:42:14,616 INFO 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 11:42:14,619 INFO 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 11:42:14,752 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:42:14,752 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,758 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,776 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,779 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,798 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,816 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,816 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,832 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,835 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,835 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,852 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,852 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,869 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,869 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,887 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,887 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,905 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,922 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,941 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,941 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,957 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,959 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,980 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:14,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:14,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:14,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:14,997 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,014 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,015 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,031 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,050 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:42:15,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,204 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,204 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,232 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,247 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,248 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:42:15,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,398 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,398 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,419 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,437 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_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/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 11:42:15,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:42:15,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:42:15,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:42:15,454 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 11:42:15,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:42:15 BoogieIcfgContainer [2018-11-18 11:42:15,486 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:42:15,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:42:15,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:42:15,487 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:42:15,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:42:06" (3/4) ... [2018-11-18 11:42:15,490 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 11:42:15,522 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ea4dae9e-7b15-48e7-b0af-01c6c70c185f/bin-2019/uautomizer/witness.graphml [2018-11-18 11:42:15,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:42:15,523 INFO L168 Benchmark]: Toolchain (without parser) took 10438.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.1 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -413.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,523 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:42:15,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.80 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 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 11:42:15,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -211.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,524 INFO L168 Benchmark]: Boogie Preprocessor took 40.31 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,524 INFO L168 Benchmark]: RCFGBuilder took 807.89 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,524 INFO L168 Benchmark]: BuchiAutomizer took 9072.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -350.8 MB). Peak memory consumption was 484.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,525 INFO L168 Benchmark]: Witness Printer took 35.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 294.4 kB). Peak memory consumption was 294.4 kB. Max. memory is 11.5 GB. [2018-11-18 11:42:15,527 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.80 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 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 102.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 921.7 MB in the beginning and 1.1 GB in the end (delta: -211.8 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.31 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 807.89 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9072.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 315.6 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -350.8 MB). Peak memory consumption was 484.4 MB. Max. memory is 11.5 GB. * Witness Printer took 35.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 294.4 kB). Peak memory consumption was 294.4 kB. 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.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 2.6s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 490 SDs, 0 SdLazy, 3703 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 58ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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...