./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_label24_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 ae8b9d15518dcb8efb3092579c510710d5de6c08 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-2e94e6a [2019-01-01 22:24:02,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:24:02,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:24:02,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:24:02,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:24:02,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:24:02,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:24:02,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:24:02,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:24:02,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:24:02,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:24:02,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:24:02,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:24:02,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:24:02,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:24:02,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:24:02,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:24:02,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:24:02,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:24:02,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:24:02,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:24:02,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:24:02,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:24:02,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:24:02,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:24:02,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:24:02,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:24:02,642 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:24:02,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:24:02,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:24:02,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:24:02,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:24:02,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:24:02,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:24:02,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:24:02,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:24:02,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:24:02,678 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:24:02,679 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:24:02,680 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:24:02,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:24:02,680 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:24:02,680 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:24:02,680 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:24:02,681 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:24:02,682 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:24:02,682 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:24:02,682 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:24:02,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:24:02,682 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:24:02,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:24:02,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:24:02,685 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:24:02,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:24:02,685 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:24:02,686 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:24:02,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:24:02,686 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:24:02,686 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:24:02,686 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:24:02,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:24:02,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:24:02,688 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:24:02,689 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:24:02,689 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 -> ae8b9d15518dcb8efb3092579c510710d5de6c08 [2019-01-01 22:24:02,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:24:02,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:24:02,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:24:02,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:24:02,770 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:24:02,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2019-01-01 22:24:02,835 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e096cf0e/d4e5728296d1485690a168f3c1f843a4/FLAGb51658014 [2019-01-01 22:24:03,407 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:24:03,408 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label24_true-unreach-call_false-termination.c [2019-01-01 22:24:03,421 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e096cf0e/d4e5728296d1485690a168f3c1f843a4/FLAGb51658014 [2019-01-01 22:24:03,689 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e096cf0e/d4e5728296d1485690a168f3c1f843a4 [2019-01-01 22:24:03,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:24:03,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:24:03,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:24:03,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:24:03,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:24:03,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:24:03" (1/1) ... [2019-01-01 22:24:03,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbc90c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:03, skipping insertion in model container [2019-01-01 22:24:03,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:24:03" (1/1) ... [2019-01-01 22:24:03,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:24:03,767 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:24:04,218 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:24:04,224 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:24:04,391 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:24:04,411 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:24:04,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04 WrapperNode [2019-01-01 22:24:04,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:24:04,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:24:04,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:24:04,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:24:04,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:24:04,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:24:04,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:24:04,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:24:04,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (1/1) ... [2019-01-01 22:24:04,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:24:04,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:24:04,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:24:04,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:24:04,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24: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-01 22:24:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:24:04,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:24:07,992 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:24:07,992 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:24:07,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:24:07 BoogieIcfgContainer [2019-01-01 22:24:07,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:24:07,994 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:24:07,994 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:24:07,999 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:24:08,000 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:08,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:24:03" (1/3) ... [2019-01-01 22:24:08,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd03ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:24:08, skipping insertion in model container [2019-01-01 22:24:08,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:08,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:04" (2/3) ... [2019-01-01 22:24:08,004 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd03ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:24:08, skipping insertion in model container [2019-01-01 22:24:08,005 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:08,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:24:07" (3/3) ... [2019-01-01 22:24:08,009 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label24_true-unreach-call_false-termination.c [2019-01-01 22:24:08,060 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:24:08,061 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:24:08,061 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:24:08,062 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:24:08,062 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:24:08,062 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:24:08,062 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:24:08,062 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:24:08,063 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:24:08,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:24:08,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:24:08,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:08,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:08,143 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:08,143 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:24:08,143 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:24:08,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:24:08,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:24:08,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:08,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:08,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:08,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:24:08,166 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-01 22:24:08,167 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-01 22:24:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:24:08,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:08,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:08,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:08,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-01 22:24:08,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:08,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:08,342 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-01 22:24:08,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:08,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:08,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:08,520 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-01 22:24:08,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:24:09,058 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-01 22:24:09,466 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 22:24:09,481 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:09,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:09,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:09,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:09,483 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:09,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:09,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:09,484 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:09,485 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:24:09,485 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:09,485 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:09,515 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-01 22:24:09,559 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-01 22:24:09,946 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-01 22:24:09,946 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-01 22:24:09,961 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-01 22:24:09,967 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-01 22:24:09,970 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-01 22:24:09,973 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-01 22:24:09,985 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-01 22:24:10,412 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:24:10,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:10,503 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-01 22:24:10,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:10,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,517 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-01 22:24:10,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:10,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,551 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:10,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,572 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:10,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,591 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) [2019-01-01 22:24:10,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,644 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:10,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,656 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-01 22:24:10,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:10,706 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,706 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) [2019-01-01 22:24:10,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,758 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:10,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,771 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) [2019-01-01 22:24:10,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,803 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:10,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:10,820 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-01 22:24:10,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:10,849 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-01 22:24:10,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:10,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:10,906 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:24:10,908 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:10,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:10,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:10,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:10,908 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:24:10,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:10,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:10,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:10,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:24:10,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:10,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:10,915 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-01 22:24:10,943 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-01 22:24:10,947 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-01 22:24:10,996 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-01 22:24:11,006 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-01 22:24:11,014 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-01 22:24:11,050 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-01 22:24:11,054 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-01 22:24:11,471 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:24:11,645 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:24:12,058 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:24:12,061 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:12,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:24:12,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,096 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:12,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:12,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:12,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,192 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:12,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,200 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:24: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-01 22:24:12,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,203 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,216 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,225 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,225 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,231 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:24:12,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,281 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,308 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,317 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,320 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,320 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:12,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,327 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:24:12,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,358 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,358 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,365 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:12,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,398 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,419 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,434 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,442 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,447 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:12,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,454 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:24:12,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,459 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,474 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,475 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,485 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,486 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,491 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:24:12,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,529 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,532 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,560 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:12,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,573 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,576 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:12,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:12,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,580 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,580 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,584 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:12,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,590 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:24:12,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,591 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,598 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,631 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,636 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,643 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,644 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,647 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:24:12,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,704 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,705 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,711 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,712 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,712 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,716 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,717 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,720 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,722 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:12,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,723 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:12,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,724 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:12,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:12,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,731 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:24:12,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,733 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,762 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,764 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,770 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,773 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:12,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,811 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,819 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,825 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,832 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,833 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:12,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:12,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,835 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:12,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:12,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:12,837 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:12,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,846 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:24:12,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:12,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,847 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,848 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,850 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,865 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,878 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,878 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:12,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,888 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:24:12,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:12,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,963 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,970 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:12,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,986 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,987 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:12,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:12,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-01 22:24:12,993 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:12,993 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:12,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:12,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:12,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:12,994 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:12,997 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:12,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,003 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,005 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:13,006 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:13,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,008 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,008 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:13,008 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:13,011 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:13,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,025 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:24:13,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,026 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,028 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,048 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,053 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,053 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:13,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,055 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:13,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,086 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,098 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,101 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,101 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,102 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,106 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,107 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:13,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,110 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:13,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,110 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:13,110 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:13,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:13,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,121 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:24:13,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,122 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,123 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,176 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,176 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,177 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,185 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,185 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:13,185 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,188 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 22:24:13,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,333 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,352 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,356 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,356 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,357 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:13,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:13,362 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,363 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:13,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:13,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:13,366 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:13,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:13,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:13,367 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:13,367 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:13,368 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:13,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:13,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:13,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:13,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:13,399 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-01 22:24:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:15,363 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-01 22:24:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:15,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-01 22:24:15,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-01 22:24:15,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-01 22:24:15,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-01 22:24:15,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-01 22:24:15,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-01 22:24:15,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:15,392 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-01 22:24:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-01 22:24:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-01 22:24:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-01 22:24:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-01 22:24:15,441 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:24:15,441 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:24:15,441 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:24:15,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-01 22:24:15,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-01 22:24:15,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:15,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:15,445 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:15,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:15,445 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-01 22:24:15,445 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-01 22:24:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 22:24:15,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:15,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:15,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:15,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-01 22:24:15,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:15,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:15,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-01 22:24:15,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:15,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:15,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:15,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:15,537 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-01 22:24:15,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:15,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:24:15,912 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-01 22:24:15,952 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:15,952 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:15,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:15,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:15,953 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:15,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:15,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:15,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:15,954 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:24:15,954 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:15,954 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:15,956 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-01 22:24:15,960 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-01 22:24:15,970 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-01 22:24:15,973 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-01 22:24:15,976 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-01 22:24:15,979 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-01 22:24:15,987 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-01 22:24:15,999 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-01 22:24:16,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:16,223 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-01 22:24:16,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:16,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:16,231 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-01 22:24:16,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:16,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:16,262 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-01 22:24:16,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:16,291 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:16,291 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-01 22:24:16,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:16,322 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:16,322 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-01 22:24:16,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:16,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:16,432 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-01 22:24:16,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:16,454 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) [2019-01-01 22:24:16,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:16,502 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:16,537 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:24:16,539 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:16,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:16,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:16,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:16,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:24:16,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:16,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:16,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:16,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:24:16,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:16,540 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:16,543 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-01 22:24:16,552 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-01 22:24:16,556 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-01 22:24:16,558 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-01 22:24:16,582 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-01 22:24:16,607 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-01 22:24:16,638 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-01 22:24:16,691 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-01 22:24:16,939 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:24:17,052 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:17,052 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:24:17,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:17,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,059 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,059 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:17,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:17,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,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-01 22:24:17,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,079 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:17,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:17,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:17,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,104 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:24:17,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,106 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:17,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,111 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,119 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,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-01 22:24:17,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,127 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,130 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,168 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,170 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:24:17,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-01 22:24:17,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:17,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,182 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,189 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:17,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,201 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,201 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,212 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,213 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,231 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,247 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:24:17,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,251 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,251 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,260 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,260 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,262 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,262 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,270 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,275 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,276 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,288 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,288 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,289 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,305 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:17,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:17,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,317 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,317 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,323 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:24: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-01 22:24:17,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,327 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,327 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,333 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,333 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,345 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,346 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,347 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,351 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,358 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,393 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,394 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,395 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24: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-01 22:24:17,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,414 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:17,415 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:17,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,422 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:24:17,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,422 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,433 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,433 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,440 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,448 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,450 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,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-01 22:24:17,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,460 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,460 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,478 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,482 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,513 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,534 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:17,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,535 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,546 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:24:17,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,547 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,557 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,558 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,558 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,559 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,562 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,564 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,571 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,579 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,581 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,601 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,604 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:17,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,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-01 22:24:17,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,639 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:17,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:17,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,689 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:24:17,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,690 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,694 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,695 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,697 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,700 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,704 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,704 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,705 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,710 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,711 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,712 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:17,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,720 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:17,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:17,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:17,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,735 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:24:17,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,736 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,737 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:24:17,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,741 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,742 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,742 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,742 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:17,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,746 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,750 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,750 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,762 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,762 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,763 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,763 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:17,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,781 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,782 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:17,782 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,784 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:17,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:17,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,829 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,829 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,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-01 22:24:17,894 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:17,894 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:17,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:17,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:17,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:17,898 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:17,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:17,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:17,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:17,913 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-01 22:24:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:19,223 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-01 22:24:19,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:19,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-01 22:24:19,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:24:19,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:24:19,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-01 22:24:19,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-01 22:24:19,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-01 22:24:19,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:19,242 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-01 22:24:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-01 22:24:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-01 22:24:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:24:19,269 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:19,269 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:19,269 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:24:19,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-01 22:24:19,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:24:19,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:19,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:19,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:19,275 INFO L867 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-01 22:24:19,275 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-01 22:24:19,277 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-01 22:24:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-01 22:24:19,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:19,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-01 22:24:19,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:19,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:19,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:19,595 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-01 22:24:19,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:19,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:24:19,596 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:24:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:24:19,597 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-01 22:24:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:20,934 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-01 22:24:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:24:20,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:20,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-01 22:24:20,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-01 22:24:20,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-01 22:24:20,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-01 22:24:20,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:20,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:20,959 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-01 22:24:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-01 22:24:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-01 22:24:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-01 22:24:20,997 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:24:20,997 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:24:20,997 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:24:20,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-01 22:24:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-01 22:24:21,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:21,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:21,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:21,015 INFO L867 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-01 22:24:21,017 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-01 22:24:21,017 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-01 22:24:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-01 22:24:21,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:21,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:21,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-01 22:24:21,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:21,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:21,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:21,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:21,141 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-01 22:24:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:21,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:21,143 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-01 22:24:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:22,026 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-01 22:24:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:22,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:22,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:22,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:24:22,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-01 22:24:22,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-01 22:24:22,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:22,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:22,056 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-01 22:24:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-01 22:24:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:24:22,082 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:22,082 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:22,082 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:24:22,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:22,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:22,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:22,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:22,096 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:22,096 INFO L867 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-01 22:24:22,096 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-01 22:24:22,097 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-01 22:24:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-01 22:24:22,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:22,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:22,113 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-01 22:24:22,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:22,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:22,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:22,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:22,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:22,211 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-01 22:24:22,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:22,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:22,213 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:22,214 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-01 22:24:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:23,360 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-01 22:24:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:23,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:23,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:23,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:24:23,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-01 22:24:23,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-01 22:24:23,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:23,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:23,385 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-01 22:24:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-01 22:24:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:24:23,410 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:23,410 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:23,410 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:24:23,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:23,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:23,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:23,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:23,423 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:23,423 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:23,423 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-01 22:24:23,424 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-01 22:24:23,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:23,424 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-01 22:24:23,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:23,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:23,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:23,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:23,442 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-01 22:24:23,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:23,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:23,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:23,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:23,672 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-01 22:24:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:23,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:23,674 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-01 22:24:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:24,227 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-01 22:24:24,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:24,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:24,236 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:24:24,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:24:24,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-01 22:24:24,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-01 22:24:24,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:24,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:24,251 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:24,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-01 22:24:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-01 22:24:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:24:24,272 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:24,272 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:24,272 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:24:24,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:24,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:24:24,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:24,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:24,285 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:24,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:24,285 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-01 22:24:24,289 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-01 22:24:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-01 22:24:24,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:24,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:24,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-01 22:24:24,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:24,385 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-01 22:24:24,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:24,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:24,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:24,710 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:24:25,132 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-01 22:24:25,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:25,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 22:24:27,475 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-01 22:24:27,612 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:24:27,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:24:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:24:27,622 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-01 22:24:28,737 WARN L181 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-01 22:24:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:29,401 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-01 22:24:29,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:24:29,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-01 22:24:29,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:24:29,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-01 22:24:29,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-01 22:24:29,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-01 22:24:29,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:29,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:29,432 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:29,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-01 22:24:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-01 22:24:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-01 22:24:29,453 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:29,453 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:29,453 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:24:29,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:29,461 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:24:29,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:29,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:29,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:24:29,464 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:29,464 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-01 22:24:29,464 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-01 22:24:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-01 22:24:29,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:29,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:29,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:29,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-01 22:24:29,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:29,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:29,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:29,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:29,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-01 22:24:29,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:29,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:29,755 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-01 22:24:29,915 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-01 22:24:29,974 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:29,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:29,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:29,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:29,975 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:29,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:29,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:29,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:29,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label24_true-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-01 22:24:29,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:29,975 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:29,978 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-01 22:24:30,027 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-01 22:24:30,031 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-01 22:24:30,034 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-01 22:24:30,038 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-01 22:24:30,041 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-01 22:24:30,047 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-01 22:24:30,051 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-01 22:24:30,054 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-01 22:24:30,057 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-01 22:24:30,060 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-01 22:24:30,064 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-01 22:24:30,071 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-01 22:24:30,073 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-01 22:24:30,078 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-01 22:24:30,080 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-01 22:24:30,094 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-01 22:24:30,105 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-01 22:24:30,110 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-01 22:24:30,119 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-01 22:24:30,123 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-01 22:24:30,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:30,452 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-01 22:24:30,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,467 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,467 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-01 22:24:30,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,492 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-01 22:24:30,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,518 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-01 22:24:30,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,544 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,544 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-01 22:24:30,567 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,571 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-01 22:24:30,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,621 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,621 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-01 22:24:30,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,644 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-01 22:24:30,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,664 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,667 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) [2019-01-01 22:24:30,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,689 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:30,693 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,693 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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:30,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,715 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,717 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-01 22:24:30,739 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,742 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) [2019-01-01 22:24:30,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,765 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:30,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,770 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:30,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,798 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-01 22:24:30,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,820 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-01 22:24:30,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:30,843 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:30,843 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-01 22:24:30,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:30,864 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-01 22:24:30,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:30,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,118 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-01 22:24:31,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:31,140 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,142 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,142 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-01 22:24:31,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:31,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,165 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-01 22:24:31,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:31,186 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-01 22:24:31,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:31,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,391 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-01 22:24:31,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:31,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,416 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-01 22:24:31,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:31,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:31,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:31,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 22:24:31,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:24:31 BoogieIcfgContainer [2019-01-01 22:24:31,492 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:24:31,492 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:24:31,492 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:24:31,492 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:24:31,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:24:07" (3/4) ... [2019-01-01 22:24:31,501 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:24:31,574 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:24:31,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:24:31,577 INFO L168 Benchmark]: Toolchain (without parser) took 27883.82 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 436.7 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -284.9 MB). Peak memory consumption was 151.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,579 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:24:31,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,583 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,584 INFO L168 Benchmark]: Boogie Preprocessor took 81.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,584 INFO L168 Benchmark]: RCFGBuilder took 3288.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,588 INFO L168 Benchmark]: BuchiAutomizer took 23497.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 490.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:24:31,588 INFO L168 Benchmark]: Witness Printer took 84.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:24:31,591 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 716.92 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 916.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 210.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -208.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3288.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.5 MB). Peak memory consumption was 105.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23497.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 490.5 MB. Max. memory is 11.5 GB. * Witness Printer took 84.49 ms. Allocated memory is still 1.5 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 23.4s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.8s. Construction of modules took 6.8s. Büchi inclusion checks took 2.1s. 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, 6.8s 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: 140ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69606feb=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@239a589c=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@69606feb=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@239a589c=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@69606feb=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@239a589c=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...