./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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 f8826e63977e5204bfb153113fa32b1df4948bea ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:07:08,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:07:08,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:07:08,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:07:08,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:07:08,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:07:08,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:07:08,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:07:08,466 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:07:08,467 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:07:08,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:07:08,468 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:07:08,469 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:07:08,470 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:07:08,471 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:07:08,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:07:08,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:07:08,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:07:08,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:07:08,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:07:08,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:07:08,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:07:08,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:07:08,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:07:08,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:07:08,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:07:08,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:07:08,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:07:08,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:07:08,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:07:08,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:07:08,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:07:08,488 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:07:08,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:07:08,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:07:08,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:07:08,491 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:07:08,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:07:08,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:07:08,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:07:08,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:07:08,505 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:07:08,506 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:07:08,506 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:07:08,506 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:07:08,506 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:07:08,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:07:08,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:07:08,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:07:08,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:07:08,507 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:07:08,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:07:08,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:07:08,509 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:07:08,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:07:08,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:07:08,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:07:08,509 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:07:08,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:07:08,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:07:08,512 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:07:08,513 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:07:08,513 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_6f59f413-ceec-4069-adad-dee0ccb558a6/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 -> f8826e63977e5204bfb153113fa32b1df4948bea [2018-10-27 06:07:08,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:07:08,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:07:08,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:07:08,553 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:07:08,554 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:07:08,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2018-10-27 06:07:08,602 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/data/192cae96c/141950e6298a41e5827dbf9cedd973a9/FLAGb7c571048 [2018-10-27 06:07:09,025 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:07:09,025 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2018-10-27 06:07:09,034 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/data/192cae96c/141950e6298a41e5827dbf9cedd973a9/FLAGb7c571048 [2018-10-27 06:07:09,046 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/data/192cae96c/141950e6298a41e5827dbf9cedd973a9 [2018-10-27 06:07:09,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:07:09,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:07:09,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:09,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:07:09,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:07:09,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09, skipping insertion in model container [2018-10-27 06:07:09,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:07:09,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:07:09,464 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:09,467 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:07:09,536 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:07:09,557 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:07:09,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09 WrapperNode [2018-10-27 06:07:09,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:07:09,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:09,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:07:09,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:07:09,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:07:09,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:07:09,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:07:09,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:07:09,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... [2018-10-27 06:07:09,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:07:09,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:07:09,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:07:09,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:07:09,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:09,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:07:09,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:07:12,675 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:07:12,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:12 BoogieIcfgContainer [2018-10-27 06:07:12,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:07:12,676 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:07:12,676 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:07:12,678 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:07:12,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:12,679 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:07:09" (1/3) ... [2018-10-27 06:07:12,680 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1786dd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:12, skipping insertion in model container [2018-10-27 06:07:12,680 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:12,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:07:09" (2/3) ... [2018-10-27 06:07:12,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1786dd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:07:12, skipping insertion in model container [2018-10-27 06:07:12,681 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:07:12,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:12" (3/3) ... [2018-10-27 06:07:12,682 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label28_true-unreach-call_false-termination.c [2018-10-27 06:07:12,733 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:07:12,733 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:07:12,734 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:07:12,734 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:07:12,734 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:07:12,735 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:07:12,735 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:07:12,735 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:07:12,735 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:07:12,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:07:12,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:07:12,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:12,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:12,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:12,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:12,789 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:07:12,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:07:12,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:07:12,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:12,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:12,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:12,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:07:12,804 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-10-27 06:07:12,804 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-10-27 06:07:12,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:07:12,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,895 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-10-27 06:07:12,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:12,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-10-27 06:07:12,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:12,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:13,300 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-10-27 06:07:13,356 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:13,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:13,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:13,357 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:13,357 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:07:13,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:13,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:13,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:13,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:07:13,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:13,358 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:13,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,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-10-27 06:07:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:13,827 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:13,828 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:13,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:13,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:13,856 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:13,856 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:13,860 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:13,860 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:13,875 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:13,875 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:07:13,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:13,918 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:13,967 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:13,967 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:13,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:13,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:14,014 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:14,014 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:14,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:14,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:14,077 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:14,077 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:14,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:14,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:14,086 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:14,086 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:14,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:14,105 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:14,110 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:14,110 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:14,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:14,131 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:14,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:14,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:14,186 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:07:14,188 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:14,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:14,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:14,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:14,189 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:14,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:14,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:14,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:14,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:07:14,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:14,190 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:14,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:14,661 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:07:15,162 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:07:15,164 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:15,170 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:15,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,219 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:15,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:15,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,272 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:15,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,279 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:07:15,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,280 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,292 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,293 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,296 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,298 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,298 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,300 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:15,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,331 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,352 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,360 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:15,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,376 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:07:15,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,394 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,396 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:15,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,448 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,448 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,462 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,464 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,464 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,465 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:15,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,476 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:07:15,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,477 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,478 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,496 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,499 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,500 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,501 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:07:15,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,531 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,531 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,538 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,543 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,545 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,549 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:15,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,555 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,555 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:15,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,561 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:07:15,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,563 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,564 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,588 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,589 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,599 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,601 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:07:15,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,648 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,649 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,650 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,655 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,655 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,663 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,663 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,664 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,664 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,669 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,670 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:15,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,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-10-27 06:07:15,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,672 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,672 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,672 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:15,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:15,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,679 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:07:15,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,701 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,707 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,709 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:15,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,757 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,757 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,758 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,764 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,770 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,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-10-27 06:07:15,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,775 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,780 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:15,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,780 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:15,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,790 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:07:15,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,795 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,807 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,808 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,815 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,815 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,820 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:07:15,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,877 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,879 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,887 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,894 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,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-10-27 06:07:15,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,900 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,901 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:15,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,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-10-27 06:07:15,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,903 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:15,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:15,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:15,905 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:15,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,915 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:07:15,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-10-27 06:07:15,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,921 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,936 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,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-10-27 06:07:15,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,939 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:15,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,940 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:15,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,971 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,991 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:15,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:15,997 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:15,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:15,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:15,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:15,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:15,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:15,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:15,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:15,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:16,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:16,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:16,001 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:16,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,017 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:07:16,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-10-27 06:07:16,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,018 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,057 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,058 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,067 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,068 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:07:16,068 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,070 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:07:16,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,157 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,172 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,172 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,172 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,181 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,181 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:16,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:16,193 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:16,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,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-10-27 06:07:16,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:16,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:16,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:16,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:16,202 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:16,202 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:16,203 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:16,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:16,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:16,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:16,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:16,229 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-10-27 06:07:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:17,836 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-10-27 06:07:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:17,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-10-27 06:07:17,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-10-27 06:07:17,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-10-27 06:07:17,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-10-27 06:07:17,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-10-27 06:07:17,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-10-27 06:07:17,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:17,855 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-10-27 06:07:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-10-27 06:07:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-27 06:07:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 06:07:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-10-27 06:07:17,892 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:07:17,892 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:07:17,892 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:07:17,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-10-27 06:07:17,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-10-27 06:07:17,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:17,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:17,898 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:17,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:17,898 INFO L793 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 629#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; 630#L606-3 [2018-10-27 06:07:17,898 INFO L795 eck$LassoCheckResult]: Loop: 630#L606-3 assume true; 848#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 731#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 732#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 872#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 758#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 694#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 695#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 843#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 631#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 632#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 630#L606-3 [2018-10-27 06:07:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:07:17,899 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:17,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-10-27 06:07:17,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:17,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:17,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-10-27 06:07:17,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:17,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:17,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:18,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:18,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:07:18,189 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-10-27 06:07:18,215 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:18,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:18,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:18,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:18,215 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:07:18,215 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:18,215 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:18,215 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:18,216 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:07:18,216 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:18,216 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:18,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,403 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:18,403 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,423 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:18,423 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,431 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:18,431 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,458 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:18,458 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,478 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:18,478 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,495 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,515 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:18,515 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:18,520 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:18,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:18,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:18,571 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:07:18,572 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:18,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:18,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:18,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:18,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:07:18,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:18,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:18,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:18,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:07:18,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:18,573 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:18,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:18,812 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:18,812 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:07:18,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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-10-27 06:07:18,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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-10-27 06:07:18,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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-10-27 06:07:18,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,837 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:07:18,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:07:18,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,854 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:07:18,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-10-27 06:07:18,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,855 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,855 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:18,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,857 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:18,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,859 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,861 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,861 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:18,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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-10-27 06:07:18,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,871 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,871 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:18,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,876 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,877 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:18,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,881 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:18,894 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:18,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,897 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:07:18,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-10-27 06:07:18,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,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-10-27 06:07:18,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,904 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:18,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,921 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,922 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:18,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,925 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,926 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:18,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:18,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:18,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,950 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:07:18,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-10-27 06:07:18,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,951 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:18,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,954 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,954 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:18,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,957 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,957 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,966 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:18,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,968 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:18,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:18,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,972 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,972 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,972 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:18,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,988 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:18,988 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,988 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:18,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:18,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:18,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:18,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:07:18,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:18,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:18,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:18,994 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:18,995 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:18,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,010 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:07:19,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-10-27 06:07:19,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,011 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,012 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:19,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,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-10-27 06:07:19,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,014 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:19,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,019 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,019 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,019 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,021 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,034 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:19,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,035 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,035 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,036 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:19,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,038 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,038 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,043 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,063 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,063 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:07:19,064 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:07:19,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,075 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,076 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:07:19,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,076 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,080 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,081 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,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-10-27 06:07:19,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,085 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,098 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,099 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,100 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,101 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,101 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,103 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,103 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,103 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,106 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,107 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,107 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,108 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,126 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,126 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,151 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:07:19,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,167 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:07:19,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,167 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,168 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,169 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:19,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,186 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,186 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,186 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,187 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:19,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,195 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,195 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,196 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:19,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,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-10-27 06:07:19,198 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,198 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,198 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,199 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:19,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,201 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,214 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:19,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,219 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,219 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,219 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,221 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:19,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,243 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,246 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:07:19,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,334 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,334 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:07:19,336 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:07:19,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,351 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:07:19,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,352 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,352 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,352 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,354 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,355 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,355 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,355 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,359 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,359 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,360 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,362 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,362 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,362 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,365 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,365 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,367 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,367 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,368 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,372 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,374 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:07:19,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,381 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:07:19,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,381 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:07:19,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:07:19,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,387 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:07:19,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,388 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,388 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,391 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,392 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,399 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,400 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:19,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,402 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,403 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,406 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,409 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,410 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,410 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:19,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,426 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,427 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:07:19,427 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,428 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:07:19,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:07:19,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:07:19,472 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:07:19,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:07:19,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:07:19,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:07:19,473 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:07:19,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:07:19,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:07:19,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:07:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:19,514 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-10-27 06:07:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:20,464 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-10-27 06:07:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:20,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-10-27 06:07:20,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:07:20,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:07:20,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-10-27 06:07:20,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-10-27 06:07:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-10-27 06:07:20,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:20,478 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-10-27 06:07:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-10-27 06:07:20,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-27 06:07:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:07:20,496 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:20,496 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:07:20,496 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:07:20,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-10-27 06:07:20,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:07:20,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:20,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:20,504 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:20,504 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-10-27 06:07:20,504 INFO L793 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1670#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; 1671#L606-3 [2018-10-27 06:07:20,509 INFO L795 eck$LassoCheckResult]: Loop: 1671#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 !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1774#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1923#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1682#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2293#L606-3 assume true; 2292#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2290#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2289#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2288#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2287#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2286#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2285#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2284#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2283#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2282#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2280#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2278#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2276#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2274#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2273#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2272#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2014#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2015#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2281#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2279#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2277#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2275#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2012#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2013#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2267#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2265#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2263#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2262#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2260#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2258#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2016#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2017#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2115#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2109#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2107#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2105#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2104#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2103#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2102#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2101#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2100#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2098#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2096#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2094#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1815#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1671#L606-3 [2018-10-27 06:07:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:07:20,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:20,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:20,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-10-27 06:07:20,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:20,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:20,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:20,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:20,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:20,790 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-27 06:07:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:07:20,876 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:07:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:07:20,876 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-10-27 06:07:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:22,228 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-10-27 06:07:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:07:22,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:22,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-10-27 06:07:22,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-10-27 06:07:22,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-10-27 06:07:22,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-10-27 06:07:22,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:22,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:22,253 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-10-27 06:07:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-10-27 06:07:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-10-27 06:07:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-27 06:07:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-10-27 06:07:22,282 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-10-27 06:07:22,282 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-10-27 06:07:22,282 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:07:22,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-10-27 06:07:22,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-10-27 06:07:22,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:22,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:22,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:22,291 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-10-27 06:07:22,291 INFO L793 eck$LassoCheckResult]: Stem: 3695#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; 3565#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; 3566#L606-3 [2018-10-27 06:07:22,291 INFO L795 eck$LassoCheckResult]: Loop: 3566#L606-3 assume true; 4660#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4656#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4652#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4648#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4645#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4643#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3827#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 3805#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3577#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3821#L606-3 assume true; 3814#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3674#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3675#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3665#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4695#L606-3 assume true; 4694#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4692#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4690#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4688#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4680#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4681#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4721#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4720#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4719#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4718#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4717#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4716#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4715#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4714#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4713#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4711#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4710#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4709#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4708#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4706#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4704#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4702#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4700#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4679#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 3669#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 3670#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 3671#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 3672#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 3673#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 3589#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 3590#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 3844#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 3644#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 3645#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3676#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 3598#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 3600#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 3677#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 3603#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 3605#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 3658#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 3624#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 3625#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 3736#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 3737#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 3794#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 3661#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 3662#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 3663#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3682#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3566#L606-3 [2018-10-27 06:07:22,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:22,292 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:07:22,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:22,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:22,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:22,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:22,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:22,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-10-27 06:07:22,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:22,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:07:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:22,391 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:22,391 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-10-27 06:07:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:23,916 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-10-27 06:07:23,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:23,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-10-27 06:07:23,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-10-27 06:07:23,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-10-27 06:07:23,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-10-27 06:07:23,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-10-27 06:07:23,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-10-27 06:07:23,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:23,933 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-10-27 06:07:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-10-27 06:07:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-10-27 06:07:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-10-27 06:07:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-10-27 06:07:23,959 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-10-27 06:07:23,959 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-10-27 06:07:23,959 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:07:23,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-10-27 06:07:23,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:23,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:23,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:23,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:23,971 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-10-27 06:07:23,971 INFO L793 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6305#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; 6306#L606-3 [2018-10-27 06:07:23,972 INFO L795 eck$LassoCheckResult]: Loop: 6306#L606-3 assume true; 7667#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7663#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7618#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7598#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7582#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7581#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7580#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7578#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7576#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7574#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7572#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7570#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7568#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7301#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7300#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7298#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7296#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7295#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7198#L606-3 assume true; 7312#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7310#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7189#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6452#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7525#L606-3 assume true; 7523#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7521#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7519#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7517#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7436#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7437#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7723#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7721#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7718#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7716#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7713#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7709#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7705#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7701#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7697#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7687#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7019#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7020#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7203#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7385#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7383#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7381#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7378#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7376#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7373#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7370#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7369#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7368#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7367#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7365#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7363#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7361#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7359#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7357#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7355#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7354#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7352#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7350#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7348#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7346#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7344#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7342#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7340#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7338#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7336#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7025#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7014#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7011#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7009#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6456#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6306#L606-3 [2018-10-27 06:07:23,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:23,972 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:07:23,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:23,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:23,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:23,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:23,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:23,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-10-27 06:07:23,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:23,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:23,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:07:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:24,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:24,090 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:24,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:24,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:24,090 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-10-27 06:07:24,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:24,609 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-10-27 06:07:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:24,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-10-27 06:07:24,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:24,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-10-27 06:07:24,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-10-27 06:07:24,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-10-27 06:07:24,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-10-27 06:07:24,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:24,629 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-10-27 06:07:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-10-27 06:07:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-10-27 06:07:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-27 06:07:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-10-27 06:07:24,653 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-10-27 06:07:24,653 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-10-27 06:07:24,653 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:07:24,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-10-27 06:07:24,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:07:24,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:24,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:24,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:24,664 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-10-27 06:07:24,664 INFO L793 eck$LassoCheckResult]: Stem: 9450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9326#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; 9327#L606-3 [2018-10-27 06:07:24,664 INFO L795 eck$LassoCheckResult]: Loop: 9327#L606-3 assume true; 10151#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10149#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10147#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10145#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10143#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10141#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10139#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10138#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10137#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10135#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10133#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10131#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10130#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10128#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10127#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10126#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10124#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9896#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9897#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10268#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10266#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10264#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10263#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10262#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10261#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10260#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10258#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10256#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 10254#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9699#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9852#L606-3 assume true; 9850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9848#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9846#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9844#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9842#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9840#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9838#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9836#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9833#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9831#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9829#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9827#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9825#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9823#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9821#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9819#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9817#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9815#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9813#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9811#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9809#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9807#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9805#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9803#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9801#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9799#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9797#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9795#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9793#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9791#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9789#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9787#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9785#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9783#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9781#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9779#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9777#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9775#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9773#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9771#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9769#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9766#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9764#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9762#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9760#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9758#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9756#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9754#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9751#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9752#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9327#L606-3 [2018-10-27 06:07:24,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:07:24,665 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:24,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:24,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-10-27 06:07:24,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:24,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:24,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:07:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:24,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:24,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:07:24,837 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:07:24,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:07:24,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:07:24,837 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-10-27 06:07:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:25,104 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-10-27 06:07:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:07:25,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-10-27 06:07:25,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:07:25,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-10-27 06:07:25,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-10-27 06:07:25,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-10-27 06:07:25,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-10-27 06:07:25,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:25,122 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-10-27 06:07:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-10-27 06:07:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-10-27 06:07:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-27 06:07:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-10-27 06:07:25,143 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-10-27 06:07:25,143 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-10-27 06:07:25,143 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:07:25,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-10-27 06:07:25,148 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:07:25,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:25,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:25,149 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:07:25,149 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-10-27 06:07:25,149 INFO L793 eck$LassoCheckResult]: Stem: 12455#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; 12335#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; 12336#L606-3 [2018-10-27 06:07:25,157 INFO L795 eck$LassoCheckResult]: Loop: 12336#L606-3 assume true; 13237#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13235#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13233#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13231#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13229#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13227#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13225#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13182#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13183#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13220#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13218#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13216#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13214#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13212#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13211#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13209#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13207#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13205#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13203#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13201#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13198#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13196#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13194#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13192#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13190#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13186#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13184#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12844#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12845#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13144#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13142#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13140#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13138#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13136#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13134#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13132#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13130#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13128#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13126#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13124#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13122#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13120#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13118#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13116#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12842#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12843#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13424#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13422#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13420#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13418#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13416#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13414#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13412#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13410#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13408#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13406#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13404#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13402#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13400#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13398#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13396#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13394#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13392#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13390#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13388#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13386#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13384#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13382#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13380#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13378#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13376#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13374#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13372#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13370#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13368#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13366#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13364#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13362#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13360#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13358#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13356#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13354#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13352#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13350#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13348#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12352#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13345#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13343#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13341#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13339#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13337#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13335#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13333#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13331#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13329#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13326#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13324#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13322#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13320#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13318#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13316#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13314#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13312#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13310#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13308#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13306#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13304#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13302#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13301#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13299#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13297#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13294#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13292#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13290#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13288#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13286#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13284#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13282#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13280#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13278#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13276#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13274#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13272#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13270#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13268#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13266#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13264#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13262#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13260#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13258#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13256#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13254#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13252#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13250#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13248#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13246#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13244#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13242#L594-1 calculate_output_#res := -2; 13240#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12336#L606-3 [2018-10-27 06:07:25,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:07:25,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:25,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:25,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:25,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:25,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:25,178 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-10-27 06:07:25,178 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:25,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:25,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-10-27 06:07:25,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:07:25,502 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:07:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:07:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:07:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:07:26,997 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-10-27 06:07:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:07:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:07:27,072 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-10-27 06:07:27,478 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-27 06:07:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:07:28,155 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-10-27 06:07:28,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:07:28,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-10-27 06:07:28,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-10-27 06:07:28,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-10-27 06:07:28,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-10-27 06:07:28,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-10-27 06:07:28,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-10-27 06:07:28,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:07:28,178 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-10-27 06:07:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-10-27 06:07:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-10-27 06:07:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-10-27 06:07:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-10-27 06:07:28,200 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-10-27 06:07:28,200 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-10-27 06:07:28,200 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:07:28,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-10-27 06:07:28,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-10-27 06:07:28,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:07:28,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:07:28,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:28,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:07:28,210 INFO L793 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15544#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; 15545#L606-3 assume true; 16908#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16905#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16901#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16896#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15804#L597 [2018-10-27 06:07:28,211 INFO L795 eck$LassoCheckResult]: Loop: 15804#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 17067#L606-3 assume true; 17066#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17065#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17064#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 17063#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 17062#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 17061#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 17060#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15804#L597 [2018-10-27 06:07:28,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:28,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-10-27 06:07:28,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:28,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:28,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:28,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-10-27 06:07:28,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:28,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:28,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:28,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:07:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-10-27 06:07:28,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:07:28,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:07:28,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:07:28,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:07:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:07:28,704 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-27 06:07:28,823 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:07:28,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:07:28,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:07:28,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:07:28,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:07:28,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:07:28,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:07:28,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:07:28,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-10-27 06:07:28,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:07:28,824 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:07:28,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,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-10-27 06:07:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,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-10-27 06:07:28,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:28,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-10-27 06:07:28,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:07:29,103 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:07:29,103 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,110 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,110 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,146 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,146 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,152 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,152 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,174 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,174 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,195 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,196 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,232 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,232 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,239 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,239 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,274 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,274 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,297 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,297 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,306 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,306 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,342 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,342 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,367 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,367 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,379 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,379 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,399 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,399 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,435 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,435 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,439 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:29,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,673 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,673 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,694 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,694 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,711 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:07:29,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,884 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,884 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,922 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,922 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,934 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,934 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/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-10-27 06:07:29,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:07:29,953 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:07:29,955 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:07:29,956 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-10-27 06:07:29,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:07:29 BoogieIcfgContainer [2018-10-27 06:07:29,996 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:07:29,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:07:29,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:07:29,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:07:29,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:07:12" (3/4) ... [2018-10-27 06:07:30,005 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:07:30,046 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6f59f413-ceec-4069-adad-dee0ccb558a6/bin-2019/uautomizer/witness.graphml [2018-10-27 06:07:30,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:07:30,047 INFO L168 Benchmark]: Toolchain (without parser) took 20996.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 958.1 MB in the beginning and 984.6 MB in the end (delta: -26.5 MB). Peak memory consumption was 320.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,047 INFO L168 Benchmark]: CDTParser took 0.19 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-10-27 06:07:30,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 928.5 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -222.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,048 INFO L168 Benchmark]: Boogie Preprocessor took 60.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,048 INFO L168 Benchmark]: RCFGBuilder took 2897.22 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: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,048 INFO L168 Benchmark]: BuchiAutomizer took 17320.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.0 GB in the beginning and 984.6 MB in the end (delta: 55.9 MB). Peak memory consumption was 368.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:07:30,049 INFO L168 Benchmark]: Witness Printer took 49.39 ms. Allocated memory is still 1.4 GB. Free memory is still 984.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:07:30,057 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.19 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 506.73 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 928.5 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 928.5 MB in the beginning and 1.2 GB in the end (delta: -222.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2897.22 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: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17320.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.0 GB in the beginning and 984.6 MB in the end (delta: 55.9 MB). Peak memory consumption was 368.4 MB. Max. memory is 11.5 GB. * Witness Printer took 49.39 ms. Allocated memory is still 1.4 GB. Free memory is still 984.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 9.4s. Construction of modules took 6.1s. Büchi inclusion checks took 1.2s. 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, 6.1s 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: 93ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - 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@7e47f223=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fe5f1b=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@7e47f223=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2fe5f1b=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@7e47f223=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@2fe5f1b=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...