./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:19:01,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:19:01,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:19:01,282 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:19:01,282 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:19:01,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:19:01,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:19:01,286 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:19:01,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:19:01,287 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:19:01,288 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:19:01,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:19:01,289 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:19:01,290 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:19:01,291 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:19:01,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:19:01,292 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:19:01,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:19:01,295 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:19:01,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:19:01,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:19:01,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:19:01,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:19:01,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:19:01,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:19:01,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:19:01,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:19:01,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:19:01,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:19:01,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:19:01,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:19:01,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:19:01,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:19:01,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:19:01,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:19:01,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:19:01,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:19:01,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:19:01,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:19:01,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:19:01,319 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:19:01,319 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:19:01,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:19:01,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:19:01,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:19:01,322 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:19:01,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:19:01,322 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:19:01,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:19:01,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:19:01,323 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:19:01,324 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:19:01,325 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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 -> 43cbcba3b52a19a4f3b50b9a2bc823d03105b297 [2018-11-18 11:19:01,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:19:01,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:19:01,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:19:01,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:19:01,362 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:19:01,362 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-11-18 11:19:01,406 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/data/2b89c074e/0f95f0cbcc904127b004ce90f94aa8d4/FLAG575537be4 [2018-11-18 11:19:01,794 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:19:01,795 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/sv-benchmarks/c/eca-rers2012/Problem02_label41_true-unreach-call_false-termination.c [2018-11-18 11:19:01,804 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/data/2b89c074e/0f95f0cbcc904127b004ce90f94aa8d4/FLAG575537be4 [2018-11-18 11:19:02,165 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/data/2b89c074e/0f95f0cbcc904127b004ce90f94aa8d4 [2018-11-18 11:19:02,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:19:02,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:19:02,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:19:02,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:19:02,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:19:02,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d293ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02, skipping insertion in model container [2018-11-18 11:19:02,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:19:02,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:19:02,454 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:19:02,458 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:19:02,527 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:19:02,542 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:19:02,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02 WrapperNode [2018-11-18 11:19:02,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:19:02,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:19:02,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:19:02,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:19:02,551 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:19:02" (1/1) ... [2018-11-18 11:19:02,613 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:19:02" (1/1) ... [2018-11-18 11:19:02,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:19:02,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:19:02,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:19:02,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:19:02,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... [2018-11-18 11:19:02,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:19:02,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:19:02,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:19:02,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:19:02,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 11:19:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:19:02,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:19:03,483 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:19:03,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:19:03 BoogieIcfgContainer [2018-11-18 11:19:03,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:19:03,484 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:19:03,484 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:19:03,486 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:19:03,486 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:19:03,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:19:02" (1/3) ... [2018-11-18 11:19:03,487 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6bff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:19:03, skipping insertion in model container [2018-11-18 11:19:03,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:19:03,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:19:02" (2/3) ... [2018-11-18 11:19:03,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d6bff60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:19:03, skipping insertion in model container [2018-11-18 11:19:03,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:19:03,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:19:03" (3/3) ... [2018-11-18 11:19:03,490 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label41_true-unreach-call_false-termination.c [2018-11-18 11:19:03,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:19:03,523 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:19:03,523 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:19:03,523 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:19:03,524 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:19:03,524 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:19:03,524 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:19:03,524 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:19:03,524 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:19:03,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:19:03,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:19:03,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:03,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:03,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:03,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:19:03,567 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:19:03,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 11:19:03,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 11:19:03,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:03,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:03,573 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:03,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:19:03,578 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:19:03,579 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:19:03,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 11:19:03,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:03,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 11:19:03,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:03,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:03,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 11:19:03,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:03,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:03,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:03,731 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:19:03,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:03,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:19:03,881 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:19:03,882 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:19:03,882 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:19:03,882 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:19:03,883 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:19:03,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:19:03,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:19:03,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:19:03,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:19:03,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:19:03,884 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:19:03,900 INFO 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:19:03,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:03,931 INFO 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:19:03,934 INFO 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:19:03,938 INFO 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:19:03,941 INFO 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:19:03,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:03,948 INFO 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:19:04,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:19:04,118 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,136 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,166 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,206 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,236 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,246 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,269 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,269 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,293 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,326 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:04,326 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:04,342 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:04,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:19:04,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:04,385 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:19:04,386 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:19:04,386 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:19:04,386 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:19:04,386 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:19:04,387 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:19:04,387 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:19:04,387 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:19:04,387 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:19:04,387 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 11:19:04,387 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:19:04,387 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:19:04,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:04,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:04,434 INFO 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:19:04,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:04,461 INFO 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:19:04,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:19:04,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:04,499 INFO 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:19:04,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:19:04,758 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:19:04,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,776 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:04,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:04,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:04,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:04,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:04,813 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,817 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:19:04,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,818 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,819 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,827 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,831 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:04,831 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,833 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:19:04,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,850 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,855 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,858 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,859 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,862 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,862 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:04,864 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:04,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,869 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:19:04,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:19:04,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,872 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,880 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,883 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:04,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,885 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:04,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:04,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,911 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:04,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:04,911 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:04,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,915 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:19:04,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,917 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,918 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,924 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,924 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,926 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:04,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,928 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:19:04,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,945 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,947 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,948 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,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:19:04,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:04,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:04,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,953 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:04,953 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:04,953 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:04,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,958 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:19:04,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:04,958 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:04,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,959 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,960 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:04,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:04,972 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:04,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:04,973 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,973 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:04,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:04,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:04,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:04,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:04,977 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:04,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:04,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:04,977 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:04,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:04,979 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:19:04,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:05,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:05,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,007 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:05,008 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:05,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:05,012 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:05,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:05,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:05,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:05,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:05,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,023 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:19:05,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,024 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,037 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,037 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,038 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,038 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,042 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,043 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:05,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,045 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:05,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,067 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,074 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,074 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,079 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,083 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,086 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:05,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,086 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:05,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,087 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:05,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,094 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:19:05,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,094 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,095 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,105 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,110 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,111 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:05,111 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,115 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:19:05,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,141 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,143 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,153 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,154 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,159 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,160 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:05,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,162 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,162 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:05,162 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:05,164 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:05,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,170 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:19:05,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,171 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,180 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,183 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,183 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:05,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,185 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:05,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,197 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,198 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,203 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,207 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,207 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,210 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:05,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,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:19:05,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:05,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,213 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:05,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:05,213 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:05,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,219 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:19:05,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,220 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,220 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,242 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,242 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,246 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 11:19:05,246 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,249 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 11:19:05,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,301 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,310 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,311 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:05,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,316 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,316 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,320 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:05,321 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:05,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:05,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:05,325 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:05,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:05,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:05,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:05,326 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:05,327 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:05,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:05,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:19:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:19:05,344 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 11:19:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:05,924 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 11:19:05,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:19:05,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 11:19:05,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 11:19:05,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 11:19:05,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 11:19:05,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 11:19:05,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 11:19:05,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:05,944 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 11:19:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 11:19:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 11:19:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 11:19:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 11:19:05,976 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:19:05,976 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 11:19:05,976 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:19:05,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 11:19:05,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 11:19:05,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:05,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:05,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:05,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:19:05,979 INFO L794 eck$LassoCheckResult]: Stem: 750#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-18 11:19:05,979 INFO L796 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 732#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; 733#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); 876#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 759#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); 845#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-18 11:19:05,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 11:19:05,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 11:19:05,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:05,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:19:05,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:05,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 11:19:05,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:05,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:05,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:06,022 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:19:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:19:06,112 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:19:06,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:19:06,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:19:06,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:19:06,113 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:19:06,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:19:06,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:19:06,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:19:06,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:19:06,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:19:06,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:19:06,115 INFO 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:19:06,118 INFO 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:19:06,121 INFO 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:19:06,123 INFO 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:19:06,125 INFO 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:19:06,127 INFO 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:19:06,130 INFO 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:19:06,135 INFO 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:19:06,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:19:06,226 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,233 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:06,233 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:06,265 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,296 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:06,296 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:06,315 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:06,346 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:06,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:06,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:19:06,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:06,407 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:19:06,409 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:19:06,409 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:19:06,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:19:06,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:19:06,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:19:06,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:19:06,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:19:06,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:19:06,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 11:19:06,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:19:06,409 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:19:06,411 INFO 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:19:06,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:06,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:19:06,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:06,465 INFO 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:19:06,481 INFO 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:19:06,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:06,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:19:06,593 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:19:06,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:06,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:06,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:06,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:06,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,604 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,605 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,607 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:19:06,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:19:06,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,612 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:19:06,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,616 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,620 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,622 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,623 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,626 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,633 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:19:06,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,634 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,640 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,643 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,644 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,645 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,648 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,648 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,656 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:19:06,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,657 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,659 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,660 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,663 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,664 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,666 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,668 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,668 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,669 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,672 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,672 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:19:06,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,678 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,678 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,681 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:19:06,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,682 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,683 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,685 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,685 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,686 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,689 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,689 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,691 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,693 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,693 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,693 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,695 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,696 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,696 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,700 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,708 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:19:06,709 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:19:06,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,712 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:19:06,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,713 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,717 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,717 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,722 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,724 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,727 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,727 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,730 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,731 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,732 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,738 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,738 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,738 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,739 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,750 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:19:06,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,756 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:19:06,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,762 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,763 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,764 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,770 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,772 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,774 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,775 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,777 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,778 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,783 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,784 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,785 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,796 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,798 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:19:06,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,818 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:19:06,820 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:19:06,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,829 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:19:06,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,831 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,839 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,840 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,842 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,843 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,845 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,845 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,848 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,848 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,848 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,854 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,854 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,855 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:19:06,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,900 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:19:06,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:19:06,902 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:19:06,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,908 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:19:06,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,908 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,916 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,920 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,928 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,928 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,929 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:06,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-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:19:06,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,935 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,935 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,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:19:06,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,939 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,939 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,940 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:06,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,948 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,948 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,948 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:19:06,948 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,950 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:19:06,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:19:06,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:19:06,970 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:19:06,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:19:06,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:19:06,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:19:06,971 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:19:06,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:19:06,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:19:06,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:19:06,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:19:06,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:19:06,991 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 11:19:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:07,438 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 11:19:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:19:07,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 11:19:07,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:19:07,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 11:19:07,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 11:19:07,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 11:19:07,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 11:19:07,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:07,449 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:19:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 11:19:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 11:19:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 11:19:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 11:19:07,467 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:19:07,467 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 11:19:07,467 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:19:07,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 11:19:07,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 11:19:07,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:07,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:07,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:07,471 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:19:07,472 INFO L794 eck$LassoCheckResult]: Stem: 1795#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-18 11:19:07,473 INFO L796 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1901#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#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; 1774#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); 1919#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; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2188#L606-3 assume true; 2186#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2184#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; 2182#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); 2180#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2178#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); 2176#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2174#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); 2172#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2170#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)); 2168#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); 2166#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); 2164#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); 2162#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2160#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); 2158#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2156#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2154#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2151#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); 2149#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); 2147#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2145#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); 2143#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2141#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2139#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); 2137#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2135#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); 2133#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); 2131#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2129#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2127#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2125#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2123#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); 2121#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2119#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2117#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2115#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); 2113#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); 2107#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2105#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); 2103#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); 2101#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2099#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); 2097#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2095#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2093#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)); 2092#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); 2090#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; 1781#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-18 11:19:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 11:19:07,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:07,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:07,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:07,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:07,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 11:19:07,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:07,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:07,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:19:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:07,543 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:19:07,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:07,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:19:07,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:19:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:19:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:19:07,544 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 11:19:08,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:08,188 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-18 11:19:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:19:08,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-18 11:19:08,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 11:19:08,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-18 11:19:08,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 11:19:08,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 11:19:08,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-18 11:19:08,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:08,203 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-18 11:19:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-18 11:19:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 11:19:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 11:19:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-18 11:19:08,221 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 11:19:08,221 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 11:19:08,222 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:19:08,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-18 11:19:08,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 11:19:08,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:08,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:08,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:08,229 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:19:08,229 INFO L794 eck$LassoCheckResult]: Stem: 3691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 11:19:08,229 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4374#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4372#L611 assume !((((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; 4370#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); 4368#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4366#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); 4364#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4362#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); 4318#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3750#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4302#L606-3 assume true; 4301#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4300#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; 4299#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; 3711#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4722#L606-3 assume true; 4186#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4176#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; 4175#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); 4173#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4171#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); 4169#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4167#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); 4165#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4163#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)); 4161#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); 4159#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); 4157#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); 4155#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4153#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); 4151#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4149#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4147#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4145#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); 4143#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); 4141#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4139#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); 4137#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4135#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4133#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); 4131#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4129#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); 4127#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); 4125#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4123#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4121#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4119#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4117#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); 4115#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4113#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4111#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4109#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); 4107#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4105#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4103#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); 4101#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4099#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); 4097#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); 4095#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4093#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); 4091#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4089#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4087#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)); 4085#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); 4082#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; 4083#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:19:08,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 11:19:08,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:08,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:08,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:08,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:08,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 11:19:08,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:08,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:08,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:19:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:08,262 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:19:08,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:08,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:19:08,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:19:08,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:19:08,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:19:08,263 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-18 11:19:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:08,623 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-18 11:19:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:19:08,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-18 11:19:08,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 11:19:08,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-18 11:19:08,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 11:19:08,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 11:19:08,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-18 11:19:08,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:08,636 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-18 11:19:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-18 11:19:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 11:19:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 11:19:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-18 11:19:08,650 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 11:19:08,650 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 11:19:08,650 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:19:08,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-18 11:19:08,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:19:08,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:08,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:08,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:08,656 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:19:08,656 INFO L794 eck$LassoCheckResult]: Stem: 6429#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:19:08,656 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7548#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7545#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; 7542#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); 7540#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7538#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); 7534#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7530#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); 7527#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7524#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)); 7520#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); 7517#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); 7514#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); 7509#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7504#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); 7499#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7494#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7489#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6930#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; 6536#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6920#L606-3 assume true; 6918#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6916#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; 6914#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; 6451#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6922#L606-3 assume true; 6921#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6919#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; 6917#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); 6915#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6913#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); 6911#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6909#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); 6907#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6905#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)); 6903#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); 6901#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); 6899#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); 6897#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6895#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); 6893#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6891#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6889#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6887#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); 6885#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); 6883#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6881#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); 6879#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6877#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6875#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); 6873#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6871#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); 6869#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); 6867#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6865#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6863#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6861#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6859#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); 6857#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6855#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6853#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6851#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); 6849#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6847#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6845#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); 6843#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6841#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); 6839#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); 6837#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6835#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); 6833#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6831#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6829#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)); 6827#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); 6823#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; 6824#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:19:08,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 11:19:08,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:08,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:08,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 11:19:08,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:08,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:19:08,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:08,686 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:19:08,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:08,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:19:08,687 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:19:08,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:19:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:19:08,687 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-18 11:19:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:09,012 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-18 11:19:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:19:09,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-18 11:19:09,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:19:09,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 11:19:09,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 11:19:09,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 11:19:09,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-18 11:19:09,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:09,024 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 11:19:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-18 11:19:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 11:19:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 11:19:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 11:19:09,037 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 11:19:09,037 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 11:19:09,037 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:19:09,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-18 11:19:09,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 11:19:09,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:09,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:09,043 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:09,043 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:19:09,043 INFO L794 eck$LassoCheckResult]: Stem: 9453#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:19:09,043 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10126#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10124#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; 10123#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); 10122#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10121#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); 10119#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10117#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); 10113#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10114#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)); 10107#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); 10108#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); 10668#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); 10666#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10664#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); 10662#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10660#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10657#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9905#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); 9906#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); 10064#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10062#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); 10060#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10058#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10056#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); 10054#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10052#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); 10050#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); 10048#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9798#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; 9689#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9791#L606-3 assume true; 9789#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9787#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; 9785#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); 9783#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9781#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); 9779#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9777#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); 9775#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9773#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)); 9771#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); 9769#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); 9767#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); 9765#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9763#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); 9761#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9759#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9757#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9755#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); 9753#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); 9751#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9749#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); 9747#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9745#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9743#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); 9741#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9739#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); 9737#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); 9734#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9732#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9730#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9728#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9726#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); 9724#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9722#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9720#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9718#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); 9716#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9714#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9712#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); 9710#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9708#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); 9706#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); 9704#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9702#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); 9700#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9698#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9696#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)); 9694#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); 9691#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; 9692#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:19:09,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 11:19:09,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:09,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:09,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:09,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 11:19:09,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:19:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:09,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:19:09,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:09,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:19:09,103 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:19:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:19:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:19:09,103 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-18 11:19:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:09,300 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-18 11:19:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:19:09,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-18 11:19:09,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:19:09,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 11:19:09,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 11:19:09,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 11:19:09,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-18 11:19:09,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:09,312 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 11:19:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-18 11:19:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 11:19:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 11:19:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 11:19:09,325 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 11:19:09,325 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 11:19:09,325 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:19:09,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-18 11:19:09,329 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 11:19:09,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:09,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:09,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:19:09,330 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:19:09,331 INFO L794 eck$LassoCheckResult]: Stem: 12452#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:19:09,332 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13174#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13172#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; 13170#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); 13168#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13166#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); 13164#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13162#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); 13160#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13158#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)); 13156#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); 13154#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); 13152#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); 13150#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13148#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); 13147#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13145#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13143#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13141#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); 13139#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); 13137#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13135#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); 13133#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13131#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13129#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); 13127#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13125#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); 13123#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); 13122#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12864#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12865#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13099#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13098#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); 13096#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13094#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13090#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); 13088#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13086#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13084#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); 13082#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13080#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); 13078#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); 13076#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13074#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); 13072#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13070#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13068#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)); 13066#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); 13064#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); 13062#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13060#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); 13058#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13056#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13054#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); 13052#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); 13050#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13048#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13046#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); 13044#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13042#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); 13040#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); 13038#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13036#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)); 13034#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13032#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); 13030#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13028#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)); 13026#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13024#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13022#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13020#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)); 13018#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13016#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)); 13014#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13012#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13010#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13008#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); 13006#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13004#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13002#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13000#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12998#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12996#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12994#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12992#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12990#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); 13281#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13279#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13277#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13275#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13273#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13271#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13269#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13267#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13265#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12548#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13262#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13260#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13258#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13256#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13254#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13252#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13250#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13248#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13246#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13244#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13242#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13240#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13238#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13236#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13234#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13231#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13229#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13227#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13225#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13223#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13221#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13219#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13217#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13215#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13213#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13211#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13209#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13207#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13205#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13203#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13201#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13199#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13197#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13195#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13193#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13191#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13189#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13187#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13185#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13183#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13181#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13179#L594-1 calculate_output_#res := -2; 13177#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:19:09,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 11:19:09,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 11:19:09,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:09,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:09,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:09,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 11:19:09,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:09,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:09,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:19:09,735 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:19:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:19:09,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 11:19:10,379 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 11:19:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:19:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 11:19:10,474 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-18 11:19:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:19:11,219 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 11:19:11,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 11:19:11,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 11:19:11,230 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 11:19:11,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 11:19:11,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 11:19:11,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 11:19:11,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 11:19:11,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:19:11,241 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 11:19:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 11:19:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 11:19:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 11:19:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 11:19:11,264 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 11:19:11,264 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 11:19:11,264 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:19:11,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 11:19:11,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 11:19:11,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:19:11,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:19:11,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:19:11,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:19:11,270 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; 17009#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17007#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; 17004#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); 16301#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; 15805#L597 [2018-11-18 11:19:11,271 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16277#L606-3 assume true; 16275#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16273#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; 16271#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); 16269#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16267#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); 16265#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16263#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; 15805#L597 [2018-11-18 11:19:11,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 11:19:11,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:11,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:11,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 11:19:11,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:19:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 11:19:11,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:19:11,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:19:11,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:19:11,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:19:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:19:11,467 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:19:11,467 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:19:11,467 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:19:11,467 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:19:11,467 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:19:11,468 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:19:11,468 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:19:11,468 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:19:11,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label41_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 11:19:11,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:19:11,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:19:11,469 INFO 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:19:11,474 INFO 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:19:11,476 INFO 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:19:11,477 INFO 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:19:11,479 INFO 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:19:11,480 INFO 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:19:11,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,485 INFO 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:19:11,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,489 INFO 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:19:11,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,493 INFO 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:19:11,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,496 INFO 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:19:11,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:19:11,510 INFO 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:19:11,516 INFO 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:19:11,518 INFO 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:19:11,521 INFO 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:19:11,668 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:19:11,668 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,676 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,676 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,694 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,713 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,713 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,731 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,731 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,748 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,748 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,764 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,766 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,784 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,801 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,801 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,819 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,836 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,836 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,855 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,879 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,879 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,896 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,913 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,915 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,915 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:11,932 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:11,933 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:11,948 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:11,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:19:11,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,127 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,127 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:12,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,145 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:12,173 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:19:12,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,327 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:12,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,345 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:12,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,363 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,363 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_d193a568-4c62-41e6-a586-8dbdacb7eb6b/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:19:12,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:19:12,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:19:12,380 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:19:12,380 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:19:12,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:19:12 BoogieIcfgContainer [2018-11-18 11:19:12,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:19:12,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:19:12,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:19:12,415 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:19:12,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:19:03" (3/4) ... [2018-11-18 11:19:12,418 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 11:19:12,449 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d193a568-4c62-41e6-a586-8dbdacb7eb6b/bin-2019/uautomizer/witness.graphml [2018-11-18 11:19:12,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:19:12,450 INFO L168 Benchmark]: Toolchain (without parser) took 10281.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 955.4 MB in the beginning and 1.4 GB in the end (delta: -452.5 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,451 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:19:12,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.78 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.0 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -234.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,451 INFO L168 Benchmark]: Boogie Preprocessor took 41.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,452 INFO L168 Benchmark]: RCFGBuilder took 799.15 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: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,452 INFO L168 Benchmark]: BuchiAutomizer took 8931.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -371.5 MB). Peak memory consumption was 497.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,452 INFO L168 Benchmark]: Witness Printer took 34.37 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: 300.0 kB). Peak memory consumption was 300.0 kB. Max. memory is 11.5 GB. [2018-11-18 11:19:12,454 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.78 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 915.0 MB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -234.4 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 799.15 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: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8931.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -371.5 MB). Peak memory consumption was 497.5 MB. Max. memory is 11.5 GB. * Witness Printer took 34.37 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: 300.0 kB). Peak memory consumption was 300.0 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 8.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 53ms 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@5c4c92b1=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f524a77=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@5c4c92b1=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f524a77=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@5c4c92b1=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@f524a77=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...