./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label37_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_label37_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 a2597194a43836f4c4ad9c950ead0db96723770b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:31,786 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:24:31,788 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:24:31,800 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:24:31,800 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:24:31,801 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:24:31,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:24:31,805 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:24:31,807 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:24:31,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:24:31,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:24:31,810 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:24:31,811 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:24:31,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:24:31,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:24:31,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:24:31,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:24:31,817 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:24:31,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:24:31,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:24:31,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:24:31,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:24:31,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:24:31,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:24:31,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:24:31,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:24:31,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:24:31,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:24:31,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:24:31,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:24:31,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:24:31,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:24:31,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:24:31,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:24:31,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:24:31,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:24:31,839 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:31,865 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:24:31,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:24:31,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:24:31,869 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:24:31,869 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:24:31,869 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:24:31,869 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:24:31,871 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:24:31,871 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:24:31,871 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:24:31,871 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:24:31,871 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:24:31,871 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:24:31,872 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:24:31,872 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:24:31,872 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:24:31,872 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:24:31,872 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:24:31,873 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:24:31,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:24:31,874 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:24:31,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:24:31,875 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:24:31,875 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:24:31,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:24:31,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:24:31,876 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:24:31,879 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:24:31,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:24:31,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:24:31,880 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:24:31,881 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:24:31,881 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 -> a2597194a43836f4c4ad9c950ead0db96723770b [2019-01-01 22:24:31,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:24:31,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:24:31,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:24:31,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:24:31,936 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:24:31,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label37_true-unreach-call_false-termination.c [2019-01-01 22:24:32,007 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6a7cb73/63edcc1876be4df294445246d52fb3d8/FLAG2a88d8153 [2019-01-01 22:24:32,536 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:24:32,537 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label37_true-unreach-call_false-termination.c [2019-01-01 22:24:32,554 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6a7cb73/63edcc1876be4df294445246d52fb3d8/FLAG2a88d8153 [2019-01-01 22:24:32,816 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f6a7cb73/63edcc1876be4df294445246d52fb3d8 [2019-01-01 22:24:32,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:24:32,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:24:32,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:24:32,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:24:32,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:24:32,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:24:32" (1/1) ... [2019-01-01 22:24:32,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b813b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:32, skipping insertion in model container [2019-01-01 22:24:32,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:24:32" (1/1) ... [2019-01-01 22:24:32,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:24:32,917 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:24:33,411 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:24:33,418 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:24:33,597 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:24:33,630 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:24:33,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:33 WrapperNode [2019-01-01 22:24:33,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:24:33,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:24:33,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:24:33,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:24:33,642 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:33" (1/1) ... [2019-01-01 22:24:33,659 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:33" (1/1) ... [2019-01-01 22:24:33,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:24:33,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:24:33,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:24:33,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:24:33,841 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:33" (1/1) ... [2019-01-01 22:24:33,842 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:33" (1/1) ... [2019-01-01 22:24:33,854 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:33" (1/1) ... [2019-01-01 22:24:33,854 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:33" (1/1) ... [2019-01-01 22:24:33,880 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:33" (1/1) ... [2019-01-01 22:24:33,901 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:33" (1/1) ... [2019-01-01 22:24:33,909 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:33" (1/1) ... [2019-01-01 22:24:33,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:24:33,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:24:33,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:24:33,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:24:33,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:33" (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:34,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:24:34,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:24:37,314 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:24:37,314 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:24:37,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:24:37 BoogieIcfgContainer [2019-01-01 22:24:37,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:24:37,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:24:37,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:24:37,321 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:24:37,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:37,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:24:32" (1/3) ... [2019-01-01 22:24:37,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e339ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:24:37, skipping insertion in model container [2019-01-01 22:24:37,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:37,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:24:33" (2/3) ... [2019-01-01 22:24:37,324 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e339ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:24:37, skipping insertion in model container [2019-01-01 22:24:37,324 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:24:37,324 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:24:37" (3/3) ... [2019-01-01 22:24:37,326 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label37_true-unreach-call_false-termination.c [2019-01-01 22:24:37,395 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:24:37,396 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:24:37,396 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:24:37,396 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:24:37,396 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:24:37,396 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:24:37,397 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:24:37,397 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:24:37,397 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:24:37,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:24:37,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:24:37,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:37,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:37,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:37,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:24:37,503 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:24:37,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:24:37,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:24:37,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:37,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:37,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:37,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:24:37,540 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:37,540 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:37,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:24:37,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-01 22:24:37,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:37,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-01 22:24:37,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:37,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:37,940 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:37,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:24:38,388 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-01 22:24:38,600 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 22:24:38,631 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:38,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:38,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:38,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:38,633 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:38,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:38,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:38,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:38,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:24:38,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:38,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:38,662 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:38,683 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:38,756 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:38,772 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:38,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:24:38,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:24:38,786 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:38,800 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:38,951 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:24:39,320 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:24:39,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:39,437 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:39,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,443 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:39,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,455 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:39,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:39,503 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,504 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:39,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:39,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,674 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:39,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:39,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,764 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) [2019-01-01 22:24:39,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,805 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:39,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:39,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:39,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,889 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:39,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,932 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:39,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:39,949 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:39,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:39,984 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) [2019-01-01 22:24:40,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:40,038 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:40,103 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:24:40,106 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:40,106 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:40,107 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:40,107 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:40,107 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:24:40,107 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:40,107 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:40,107 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:40,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:24:40,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:40,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:40,117 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:40,263 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 22:24:40,263 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:40,301 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:40,348 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:40,355 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:40,390 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:40,393 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:40,399 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:40,875 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:24:41,060 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:24:41,351 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:24:41,354 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:41,361 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:24:41,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,392 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:41,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:41,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:41,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,533 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:41,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:41,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,547 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:24:41,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,553 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,558 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,579 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,580 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,587 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:41,588 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,593 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:24:41,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,617 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,620 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,627 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,635 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,641 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,644 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,647 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:41,647 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:41,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,663 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:24:41,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,668 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,685 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:41,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,689 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:41,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,708 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,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:41,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,716 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,726 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,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:41,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,734 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:41,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:41,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:41,741 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:41,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,751 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:24:41,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,753 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,755 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,770 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,775 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:41,775 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,784 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:24:41,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,813 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,814 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,828 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,832 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,836 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,845 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,846 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:41,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:41,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,852 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:41,852 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:41,853 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:41,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,865 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:24:41,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,866 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,869 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,889 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,890 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,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:41,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,897 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:41,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,901 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:24:41,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,952 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,957 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,967 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:41,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,975 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,975 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,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:41,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:41,984 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,985 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:41,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:41,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:41,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:41,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:41,990 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:41,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:41,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:41,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:41,990 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:41,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:41,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,001 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:24:42,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,002 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,007 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,021 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,022 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,031 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,031 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:42,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,037 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:42,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,082 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,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:42,096 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,105 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,114 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,117 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,117 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,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:42,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,120 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:42,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,121 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:42,121 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,125 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:42,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,135 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:24:42,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,138 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,140 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,143 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,161 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,168 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,168 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:42,169 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,176 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:24:42,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,220 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,222 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,224 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,235 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,238 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,259 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,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:42,274 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,277 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,281 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:42,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,287 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:42,287 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:42,289 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:42,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,303 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:24:42,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,304 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,304 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,317 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,322 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:42,322 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,324 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:42,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,346 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,346 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,352 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,353 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,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:42,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:42,356 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,357 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,360 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,361 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,361 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:42,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:42,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:42,364 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:42,365 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:42,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,377 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:24:42,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,378 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,378 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,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:42,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,441 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,452 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,453 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:24:42,453 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,464 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 22:24:42,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,573 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,573 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,587 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,596 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,597 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:42,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:42,606 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:42,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:42,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:42,617 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:42,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:42,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:42,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:42,618 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:42,624 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:42,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:42,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:42,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:42,661 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-01 22:24:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:44,066 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-01 22:24:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:44,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-01 22:24:44,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-01 22:24:44,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-01 22:24:44,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-01 22:24:44,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-01 22:24:44,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-01 22:24:44,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:44,094 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-01 22:24:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-01 22:24:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-01 22:24:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-01 22:24:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-01 22:24:44,143 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:24:44,143 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:24:44,143 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:24:44,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-01 22:24:44,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-01 22:24:44,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:44,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:44,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:44,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:44,148 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:44,149 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:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 22:24:44,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-01 22:24:44,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:44,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:44,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-01 22:24:44,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:44,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:44,266 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:44,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:44,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:24:44,536 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-01 22:24:44,588 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:44,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:44,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:44,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:44,589 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:44,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:44,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:44,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:44,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:24:44,590 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:44,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:44,592 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:44,596 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:44,603 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:44,606 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:44,611 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:44,613 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:44,619 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:44,630 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:44,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:44,866 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:44,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:44,870 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:44,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:44,874 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:44,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:44,896 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:44,903 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:44,903 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:44,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:44,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:44,926 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:44,926 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:45,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:45,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:45,044 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:45,044 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:45,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:45,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:45,080 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:24:45,080 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:45,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:24:45,104 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:45,131 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:24:45,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:24:45,163 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:24:45,165 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:45,165 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:45,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:45,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:45,165 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:24:45,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:45,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:45,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:45,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:24:45,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:45,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:45,168 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:45,177 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:45,181 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:45,205 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:45,208 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:45,224 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:45,292 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:45,434 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 22:24:45,435 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:45,958 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 22:24:46,309 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:24:46,593 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:24:46,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:24:46,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:46,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,600 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:46,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:46,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,615 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:46,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:24:46,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:24:46,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,643 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:24:46,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,649 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,651 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,651 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,659 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,659 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,664 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,664 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,670 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,676 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,676 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,696 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,702 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,702 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,706 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:24:46,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,707 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,715 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,715 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,718 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,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:46,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,722 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,728 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,729 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,754 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,758 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:24:46,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,763 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,763 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:46,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,766 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,766 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,767 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:46,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,770 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:46,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,772 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:46,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,777 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:46,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,792 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,793 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:46,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,801 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:46,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:24:46,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:46,807 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:46,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,810 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:24:46,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:46,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,811 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,811 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,812 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,817 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,821 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,821 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,829 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,836 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,836 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,836 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,853 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,854 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,854 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:46,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,874 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,875 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,879 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,893 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,893 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:46,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:24:46,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:24:46,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,905 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:24:46,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,906 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,918 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,918 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,923 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,925 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,933 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:46,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:46,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,940 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,945 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:46,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,961 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,965 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:46,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:46,969 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:46,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:46,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:46,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:46,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:46,997 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:46,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:46,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:46,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:46,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,020 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:24:47,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,020 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,033 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:24:47,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,034 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:47,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,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:47,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,053 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,053 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,058 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:47,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,068 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:47,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,071 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,071 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,072 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:47,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,088 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,095 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,095 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,103 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:47,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,126 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,126 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,130 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:24:47,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,153 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:47,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,172 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:24:47,177 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:24:47,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,194 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:24:47,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,195 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,204 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,205 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:47,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,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:47,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,215 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,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:47,221 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,221 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,222 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,230 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,231 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:47,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,246 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,251 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:24:47,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,262 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,266 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,267 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:24:47,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,291 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:24:47,292 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:24:47,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,299 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:24:47,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:47,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,301 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:47,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:47,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,313 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,313 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,314 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:47,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,320 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,325 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:47,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,329 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,335 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:47,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,340 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,341 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,341 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,346 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:47,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,381 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,382 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:24:47,382 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,389 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:24:47,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,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:47,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,433 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:47,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:24:47,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:24:47,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:24:47,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:24:47,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:24:47,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:24:47,466 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:24:47,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:24:47,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:24:47,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:24:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:47,475 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-01 22:24:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:49,638 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-01 22:24:49,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:49,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-01 22:24:49,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:24:49,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:24:49,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-01 22:24:49,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-01 22:24:49,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-01 22:24:49,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:49,665 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-01 22:24:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-01 22:24:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-01 22:24:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:24:49,701 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:49,701 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:24:49,701 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:24:49,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-01 22:24:49,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:24:49,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:49,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:49,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:49,718 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:49,718 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:49,720 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:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:49,730 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-01 22:24:49,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:49,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:49,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:49,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-01 22:24:49,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:49,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:49,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:49,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:50,075 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:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:50,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:24:50,076 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:24:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:24:50,077 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-01 22:24:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:52,002 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-01 22:24:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:24:52,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:52,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-01 22:24:52,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-01 22:24:52,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-01 22:24:52,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-01 22:24:52,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:52,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:52,029 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-01 22:24:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-01 22:24:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-01 22:24:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-01 22:24:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-01 22:24:52,052 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:24:52,052 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:24:52,053 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:24:52,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-01 22:24:52,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-01 22:24:52,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:52,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:52,062 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:52,062 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:52,063 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:52,063 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:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-01 22:24:52,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:52,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:52,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:52,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:52,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-01 22:24:52,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:52,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:52,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:52,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:52,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:52,203 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:52,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:52,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:52,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:52,208 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-01 22:24:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:53,457 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-01 22:24:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:53,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:53,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:53,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:24:53,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-01 22:24:53,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-01 22:24:53,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:53,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:53,494 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-01 22:24:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-01 22:24:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:24:53,521 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:53,521 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:24:53,521 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:24:53,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-01 22:24:53,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:53,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:53,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:53,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:53,536 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:53,536 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:53,537 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:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-01 22:24:53,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:53,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:53,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:53,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-01 22:24:53,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:53,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:53,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:53,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:53,649 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:53,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:53,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:53,650 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:53,651 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-01 22:24:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:54,818 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-01 22:24:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:54,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:54,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:54,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:24:54,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-01 22:24:54,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-01 22:24:54,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:54,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:54,839 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-01 22:24:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-01 22:24:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:24:54,858 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:54,858 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:24:54,858 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:24:54,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-01 22:24:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:24:54,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:54,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:54,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:54,866 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:54,867 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:54,867 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:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-01 22:24:54,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:54,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:54,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-01 22:24:54,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:54,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:54,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:24:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:55,045 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:55,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:55,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:24:55,046 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:24:55,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:24:55,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:24:55,047 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-01 22:24:55,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:55,386 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-01 22:24:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:24:55,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:55,395 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:24:55,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:24:55,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-01 22:24:55,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-01 22:24:55,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:55,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:55,406 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-01 22:24:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-01 22:24:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:24:55,429 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:55,430 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:24:55,430 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:24:55,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-01 22:24:55,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:24:55,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:55,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:55,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:24:55,442 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:55,442 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:55,447 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:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-01 22:24:55,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:55,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:55,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:55,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:55,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:55,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-01 22:24:55,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:55,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:55,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-01 22:24:55,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:55,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:55,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:24:55,879 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:24:56,491 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:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:24:56,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 22:24:57,986 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-01 22:24:58,127 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:24:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:24:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:24:58,149 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-01 22:24:58,778 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-01 22:24:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:24:59,246 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-01 22:24:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:24:59,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-01 22:24:59,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:24:59,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-01 22:24:59,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-01 22:24:59,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-01 22:24:59,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:59,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:24:59,277 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-01 22:24:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-01 22:24:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-01 22:24:59,295 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:59,295 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:24:59,295 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:24:59,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-01 22:24:59,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:24:59,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:24:59,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:24:59,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:24:59,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:24:59,302 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:59,302 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:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-01 22:24:59,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:59,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:59,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:59,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-01 22:24:59,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:59,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:59,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:24:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-01 22:24:59,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:24:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:24:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:24:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:24:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:24:59,490 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-01 22:24:59,757 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-01 22:24:59,804 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:24:59,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:24:59,805 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:24:59,805 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:24:59,805 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:24:59,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:24:59,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:24:59,806 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:24:59,806 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label37_true-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-01 22:24:59,806 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:24:59,806 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:24:59,809 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:59,815 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:59,817 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:59,821 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:59,824 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:59,827 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:59,833 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:59,838 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:59,840 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:59,843 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:59,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:24:59,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:24:59,853 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:59,857 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:59,861 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:59,869 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:59,883 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:59,893 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:59,897 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:59,908 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:59,914 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:25:00,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:00,183 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:25:00,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,193 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:25:00,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,221 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:25:00,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,270 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,270 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:25:00,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,294 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,294 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:25:00,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,318 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,318 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:25:00,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,342 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:25:00,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,365 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,384 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:25:00,408 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,411 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:00,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,431 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,434 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,434 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:25:00,458 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,461 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:25:00,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,488 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,488 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:00,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,511 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,511 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:25:00,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,534 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,543 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) [2019-01-01 22:25:00,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,567 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:00,570 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,571 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) [2019-01-01 22:25:00,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,597 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:00,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,605 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:25:00,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,625 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:25:00,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:00,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,883 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,883 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:25:00,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,906 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:25:00,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,925 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:00,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:00,929 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:25:00,949 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:00,949 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:25:00,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:00,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:01,160 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:01,160 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:25:01,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:01,180 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:01,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:01,189 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:25:01,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:01,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:01,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:01,212 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:25:01,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:25:01 BoogieIcfgContainer [2019-01-01 22:25:01,261 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:25:01,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:25:01,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:25:01,262 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:25:01,263 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:37" (3/4) ... [2019-01-01 22:25:01,273 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:25:01,332 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:25:01,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:25:01,333 INFO L168 Benchmark]: Toolchain (without parser) took 28512.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.5 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -263.2 MB). Peak memory consumption was 179.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,334 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:25:01,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,339 INFO L168 Benchmark]: Boogie Preprocessor took 93.25 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,340 INFO L168 Benchmark]: RCFGBuilder took 3395.08 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: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,340 INFO L168 Benchmark]: BuchiAutomizer took 23945.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.3 MB). Peak memory consumption was 481.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:01,344 INFO L168 Benchmark]: Witness Printer took 69.92 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:25:01,352 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 808.36 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 195.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -215.6 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.25 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3395.08 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: 108.6 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23945.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 300.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -200.3 MB). Peak memory consumption was 481.9 MB. Max. memory is 11.5 GB. * Witness Printer took 69.92 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.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.8s. Construction of modules took 7.7s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s 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: 120ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - 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@7f224db3=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f1a9931=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@7f224db3=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f1a9931=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@7f224db3=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@3f1a9931=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...