./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a36e59b73de737948c8406f65f182e859a67435b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-0ed9222-m [2019-01-14 03:06:02,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:06:02,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:06:02,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:06:02,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:06:02,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:06:02,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:06:02,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:06:02,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:06:02,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:06:02,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:06:02,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:06:02,740 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:06:02,741 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:06:02,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:06:02,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:06:02,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:06:02,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:06:02,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:06:02,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:06:02,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:06:02,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:06:02,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:06:02,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:06:02,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:06:02,771 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:06:02,772 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:06:02,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:06:02,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:06:02,776 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:06:02,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:06:02,777 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:06:02,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:06:02,777 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:06:02,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:06:02,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:06:02,783 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:06:02,803 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:06:02,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:06:02,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:06:02,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:06:02,805 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:06:02,805 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:06:02,806 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:06:02,806 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:06:02,806 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:06:02,806 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:06:02,806 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:06:02,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:06:02,807 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:06:02,807 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:06:02,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:06:02,807 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:06:02,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:06:02,808 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:06:02,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:06:02,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:06:02,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:06:02,809 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:06:02,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:06:02,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:06:02,810 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:06:02,811 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:06:02,811 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a36e59b73de737948c8406f65f182e859a67435b [2019-01-14 03:06:02,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:06:02,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:06:02,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:06:02,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:06:02,889 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:06:02,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c [2019-01-14 03:06:02,956 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae73101af/5ed1e3097b41491e97eb4b318c6c5ac3/FLAG88eb47b7b [2019-01-14 03:06:03,577 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:06:03,578 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label15_true-unreach-call_false-termination.c [2019-01-14 03:06:03,594 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae73101af/5ed1e3097b41491e97eb4b318c6c5ac3/FLAG88eb47b7b [2019-01-14 03:06:03,773 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae73101af/5ed1e3097b41491e97eb4b318c6c5ac3 [2019-01-14 03:06:03,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:06:03,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:06:03,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:06:03,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:06:03,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:06:03,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:03" (1/1) ... [2019-01-14 03:06:03,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fc82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:03, skipping insertion in model container [2019-01-14 03:06:03,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:03" (1/1) ... [2019-01-14 03:06:03,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:06:03,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:06:04,350 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:06:04,356 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:06:04,492 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:06:04,509 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:06:04,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04 WrapperNode [2019-01-14 03:06:04,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:06:04,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:06:04,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:06:04,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:06:04,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:06:04,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:06:04,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:06:04,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:06:04,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... [2019-01-14 03:06:04,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:06:04,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:06:04,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:06:04,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:06:04,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:04,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:06:04,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:06:08,427 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:06:08,428 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 03:06:08,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:08 BoogieIcfgContainer [2019-01-14 03:06:08,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:06:08,430 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:06:08,430 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:06:08,434 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:06:08,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:06:08,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:06:03" (1/3) ... [2019-01-14 03:06:08,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@422f632d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:06:08, skipping insertion in model container [2019-01-14 03:06:08,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:06:08,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:04" (2/3) ... [2019-01-14 03:06:08,437 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@422f632d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:06:08, skipping insertion in model container [2019-01-14 03:06:08,437 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:06:08,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:08" (3/3) ... [2019-01-14 03:06:08,439 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label15_true-unreach-call_false-termination.c [2019-01-14 03:06:08,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:06:08,501 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:06:08,502 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:06:08,502 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:06:08,502 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:06:08,502 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:06:08,503 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:06:08,503 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:06:08,503 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:06:08,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:06:08,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:06:08,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:08,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:08,585 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:08,586 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:06:08,586 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:06:08,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:06:08,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:06:08,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:08,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:08,599 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:08,599 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:06:08,605 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~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 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-01-14 03:06:08,606 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-01-14 03:06:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:06:08,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:08,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:08,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-14 03:06:08,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-14 03:06:08,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:08,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:08,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:08,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:06:08,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:08,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:06:09,462 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-14 03:06:09,552 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:06:09,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:06:09,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:06:09,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:06:09,554 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:06:09,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:09,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:06:09,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:06:09,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:06:09,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:06:09,555 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:06:09,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:09,936 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:06:10,209 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:06:10,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:06:10,338 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,352 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,388 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,388 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:06:10,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,428 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 [2019-01-14 03:06:10,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,576 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,577 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,643 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:10,679 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:10,698 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:10,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:06:10,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:10,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:06:10,759 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:06:10,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:06:10,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:06:10,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:06:10,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:06:10,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:10,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:06:10,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:06:10,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:06:10,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:06:10,760 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:06:10,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:10,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:11,146 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 03:06:11,451 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:06:11,854 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:06:11,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:06:11,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:06:11,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,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 [2019-01-14 03:06:11,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,888 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:11,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:11,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,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 [2019-01-14 03:06:11,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:11,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:11,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:11,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:11,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,951 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:06:11,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:11,955 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:11,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,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 [2019-01-14 03:06:11,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:11,969 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:11,969 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:11,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:11,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:11,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:11,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:11,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:11,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:11,976 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:11,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:11,985 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:06:11,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,042 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,060 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,061 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,068 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,069 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,074 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,075 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,077 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:12,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,086 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:06:12,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,122 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,144 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,144 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,148 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:12,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,171 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,201 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,202 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:12,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,209 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:06:12,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,211 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,213 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,225 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,231 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,234 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:06:12,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,267 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,272 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,286 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,286 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,297 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,298 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,308 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,308 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:12,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,313 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,317 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:12,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,328 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,331 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,332 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,336 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,375 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,380 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,380 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,386 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:06:12,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,445 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,445 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,446 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,454 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,458 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,458 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,459 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,462 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,462 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,463 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:12,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,465 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,466 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:12,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:12,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,473 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:06:12,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,474 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,475 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,492 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,493 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,499 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,499 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,500 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,500 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,503 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:12,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,555 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,567 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,573 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,574 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,581 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,581 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,585 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:12,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,586 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,586 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,587 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:12,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,602 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:06:12,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,611 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,614 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,629 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,630 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,631 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,638 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,639 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,647 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:06:12,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,744 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,744 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,747 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,762 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,763 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,767 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,774 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,775 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,777 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,788 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,789 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:12,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,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 [2019-01-14 03:06:12,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,791 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,791 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:12,796 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:12,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,812 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:06:12,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,845 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,846 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,849 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:12,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,882 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,884 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,895 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,901 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,902 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:12,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,912 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:12,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,912 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:12,913 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:12,913 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:12,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,923 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:06:12,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,925 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,925 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:12,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:12,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:12,987 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:12,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:12,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:12,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:12,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:12,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:12,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:12,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:12,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:12,998 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:06:12,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,002 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 03:06:13,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:13,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:13,111 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:13,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:13,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:13,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:13,115 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:13,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:13,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:13,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:13,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:13,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:13,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:13,128 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:13,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:13,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:13,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:13,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:13,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:13,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:13,139 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:13,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:13,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:13,149 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:13,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:13,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:13,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:13,152 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:13,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:13,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:13,159 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:13,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:13,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:13,160 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:13,163 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:13,166 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:13,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:13,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:06:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:06:13,198 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-14 03:06:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:15,316 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-14 03:06:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:06:15,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-14 03:06:15,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-14 03:06:15,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-14 03:06:15,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-14 03:06:15,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-14 03:06:15,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-14 03:06:15,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:15,346 INFO L706 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-14 03:06:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-14 03:06:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-14 03:06:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 03:06:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-14 03:06:15,393 INFO L729 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:06:15,393 INFO L609 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:06:15,393 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:06:15,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-14 03:06:15,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-14 03:06:15,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:15,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:15,396 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:15,396 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:06:15,396 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~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; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2019-01-14 03:06:15,397 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2019-01-14 03:06:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:06:15,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:15,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:15,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-14 03:06:15,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:15,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:15,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:06:15,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-14 03:06:15,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:15,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:06:15,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:15,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:06:15,761 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-14 03:06:15,825 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:06:15,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:06:15,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:06:15,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:06:15,826 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:06:15,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:15,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:06:15,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:06:15,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:06:15,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:06:15,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:06:15,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:15,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:06:16,079 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,087 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:16,088 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:16,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:16,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:16,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,211 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:16,211 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:16,231 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:16,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:06:16,256 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:16,284 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:06:16,285 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:06:16,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:06:16,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:06:16,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:06:16,286 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:06:16,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:16,286 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:06:16,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:06:16,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:06:16,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:06:16,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:06:16,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:16,753 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:06:16,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:06:16,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:06:16,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:16,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,865 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:16,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:16,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:16,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:06:16,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:06:16,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,911 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:06:16,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,912 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:16,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,920 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:16,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,922 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:16,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,927 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:16,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,929 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,929 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:16,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,941 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:16,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,950 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:16,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,956 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:16,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:16,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,966 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:06:16,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,967 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,967 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,973 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,973 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,973 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:16,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:16,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:16,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:16,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,987 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,987 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,988 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:16,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:16,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:16,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 [2019-01-14 03:06:16,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:16,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:16,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:16,994 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:16,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:16,997 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:16,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,010 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,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 [2019-01-14 03:06:17,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,023 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:06:17,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,027 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,027 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,032 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,032 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,038 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,040 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,040 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,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 [2019-01-14 03:06:17,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,044 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,045 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,054 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,065 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,066 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,080 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:06:17,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,093 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,104 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:06:17,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,106 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,106 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:17,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,112 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,112 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,112 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,121 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,122 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:17,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,123 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,126 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:17,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,145 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,146 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,146 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,167 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,168 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:17,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,185 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,185 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:06:17,186 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:06:17,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,191 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:06:17,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,191 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,192 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,196 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,203 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,208 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,211 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,211 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,217 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,217 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,225 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,225 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,225 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,244 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,244 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,248 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,275 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,276 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,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 [2019-01-14 03:06:17,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,294 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:06:17,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,302 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:06:17,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,303 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,304 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,309 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,309 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,310 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,311 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,313 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,314 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,315 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,317 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,318 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,331 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,332 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,332 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,336 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,352 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,354 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,359 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:06:17,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,390 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,402 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:06:17,405 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:06:17,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,411 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:06:17,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,411 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,412 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,414 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,415 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,415 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,415 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,418 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,418 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,424 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,424 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,424 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,425 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,431 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,431 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,433 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:06:17,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,446 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,447 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,459 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:06:17,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:06:17,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:06:17,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,464 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:06:17,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,466 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,470 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,470 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,471 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,471 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:17,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,474 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,478 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,478 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,479 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,483 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,483 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,484 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:17,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,503 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:06:17,504 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,506 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:06:17,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,533 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,534 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:06:17,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:06:17,579 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:06:17,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:06:17,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:06:17,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:06:17,580 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:06:17,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:06:17,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:06:17,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:06:17,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:06:17,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:06:17,598 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-14 03:06:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:18,762 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-14 03:06:18,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:06:18,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-14 03:06:18,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:06:18,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:06:18,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-14 03:06:18,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-14 03:06:18,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-14 03:06:18,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:18,780 INFO L706 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:06:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-14 03:06:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-14 03:06:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-14 03:06:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:06:18,806 INFO L729 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:06:18,806 INFO L609 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:06:18,807 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:06:18,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-14 03:06:18,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:06:18,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:18,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:18,818 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:18,818 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [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] [2019-01-14 03:06:18,818 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~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; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2019-01-14 03:06:18,820 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2019-01-14 03:06:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:18,821 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 03:06:18,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:18,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:18,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:18,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:18,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:18,839 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-14 03:06:18,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:18,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:18,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:06:18,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:06:19,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:19,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:06:19,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:06:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:06:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:06:19,185 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-14 03:06:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:20,947 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-14 03:06:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:06:20,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-14 03:06:20,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-14 03:06:20,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-14 03:06:20,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-14 03:06:20,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-14 03:06:20,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-14 03:06:20,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:20,978 INFO L706 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-14 03:06:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-14 03:06:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-14 03:06:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-14 03:06:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-14 03:06:21,029 INFO L729 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:06:21,029 INFO L609 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:06:21,029 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:06:21,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-14 03:06:21,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-14 03:06:21,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:21,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:21,039 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:21,039 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [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] [2019-01-14 03:06:21,040 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~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; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2019-01-14 03:06:21,042 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2019-01-14 03:06:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 03:06:21,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:21,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-14 03:06:21,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:21,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:21,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:21,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:06:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:06:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:06:21,157 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:06:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:06:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:06:21,158 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-14 03:06:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:21,987 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-14 03:06:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:06:21,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-14 03:06:22,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:06:22,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:06:22,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-14 03:06:22,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-14 03:06:22,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-14 03:06:22,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:22,022 INFO L706 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:06:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-14 03:06:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-14 03:06:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-14 03:06:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:06:22,049 INFO L729 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:06:22,049 INFO L609 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:06:22,049 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:06:22,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-14 03:06:22,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:06:22,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:22,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:22,064 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:22,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [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] [2019-01-14 03:06:22,067 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~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; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2019-01-14 03:06:22,067 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2019-01-14 03:06:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-14 03:06:22,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:22,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:22,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:22,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-14 03:06:22,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:22,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:22,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:22,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:06:22,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:06:22,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:22,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:06:22,212 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:06:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:06:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:06:22,213 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-14 03:06:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:23,235 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-14 03:06:23,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:06:23,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-14 03:06:23,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:06:23,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:06:23,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-14 03:06:23,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-14 03:06:23,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-14 03:06:23,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:23,256 INFO L706 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:06:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-14 03:06:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-14 03:06:23,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-14 03:06:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:06:23,275 INFO L729 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:06:23,275 INFO L609 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:06:23,275 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:06:23,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-14 03:06:23,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:06:23,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:23,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:23,285 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:23,288 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:06:23,289 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~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; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2019-01-14 03:06:23,289 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2019-01-14 03:06:23,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-14 03:06:23,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:23,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:23,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:23,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:23,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:23,306 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-14 03:06:23,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:23,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:23,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:23,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:06:23,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:06:23,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:23,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:06:23,545 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:06:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:06:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:06:23,545 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-14 03:06:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:24,516 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-14 03:06:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:06:24,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-14 03:06:24,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:06:24,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:06:24,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-14 03:06:24,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-14 03:06:24,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-14 03:06:24,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:24,537 INFO L706 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:06:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-14 03:06:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-14 03:06:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-14 03:06:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:06:24,557 INFO L729 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:06:24,557 INFO L609 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:06:24,557 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:06:24,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-14 03:06:24,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:06:24,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:24,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:24,565 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:06:24,565 INFO L868 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] [2019-01-14 03:06:24,565 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~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; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2019-01-14 03:06:24,568 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2019-01-14 03:06:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:24,569 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-14 03:06:24,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-14 03:06:24,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:24,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:24,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-14 03:06:24,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:06:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:06:25,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:06:25,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 03:06:27,325 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-14 03:06:27,534 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 03:06:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 03:06:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 03:06:27,540 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-14 03:06:28,220 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 03:06:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:06:28,744 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-14 03:06:28,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:06:28,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-14 03:06:28,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:06:28,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-14 03:06:28,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-14 03:06:28,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-14 03:06:28,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-14 03:06:28,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:06:28,776 INFO L706 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:06:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-14 03:06:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-14 03:06:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-14 03:06:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-14 03:06:28,798 INFO L729 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:06:28,798 INFO L609 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:06:28,798 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:06:28,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-14 03:06:28,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:06:28,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:06:28,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:06:28,808 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:06:28,808 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:06:28,808 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~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; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2019-01-14 03:06:28,809 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2019-01-14 03:06:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:28,814 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-14 03:06:28,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:28,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:28,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:28,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-14 03:06:28,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:28,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:06:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-14 03:06:28,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:06:28,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:06:28,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:06:28,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:06:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:06:29,024 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-14 03:06:29,178 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-14 03:06:29,226 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:06:29,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:06:29,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:06:29,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:06:29,227 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:06:29,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:29,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:06:29,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:06:29,228 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label15_true-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-14 03:06:29,228 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:06:29,228 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:06:29,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:06:29,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:06:29,629 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,640 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,690 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,690 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,712 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,715 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,740 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,766 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,818 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,841 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,841 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,864 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,865 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:06:29,887 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,888 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:29,892 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,892 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,915 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,943 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,943 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:06:29,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,963 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:29,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,972 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:29,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:29,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:29,998 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:29,998 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,022 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,043 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:06:30,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,324 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,324 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,327 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,327 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,349 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,369 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,369 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:06:30,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,594 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,594 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 03:06:30,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:06:30,615 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:06:30,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:06:30,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 03:06:30,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:06:30 BoogieIcfgContainer [2019-01-14 03:06:30,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:06:30,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:06:30,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:06:30,669 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:06:30,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:06:08" (3/4) ... [2019-01-14 03:06:30,672 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:06:30,735 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:06:30,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:06:30,736 INFO L168 Benchmark]: Toolchain (without parser) took 26959.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.9 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -263.6 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,739 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:06:30,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.15 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,741 INFO L168 Benchmark]: Boogie Preprocessor took 79.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,747 INFO L168 Benchmark]: RCFGBuilder took 3671.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1000.0 MB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,748 INFO L168 Benchmark]: BuchiAutomizer took 22238.10 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 288.4 MB). Free memory was 1000.0 MB in the beginning and 1.2 GB in the end (delta: -216.4 MB). Peak memory consumption was 492.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:06:30,748 INFO L168 Benchmark]: Witness Printer took 66.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:06:30,753 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 732.15 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3671.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1000.0 MB in the end (delta: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22238.10 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 288.4 MB). Free memory was 1000.0 MB in the beginning and 1.2 GB in the end (delta: -216.4 MB). Peak memory consumption was 492.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.87 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 12.4s. Construction of modules took 7.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s 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: 117ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@463fbbbc=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ccd7a4e=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@463fbbbc=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ccd7a4e=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@463fbbbc=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@2ccd7a4e=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [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] 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)) [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...