./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label39_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 1e89048ccdb20a97a14cb213e125edb5cbe6d123 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:06:56,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:06:56,983 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:06:56,995 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:06:56,995 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:06:56,996 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:06:56,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:06:56,999 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:06:57,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:06:57,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:06:57,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:06:57,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:06:57,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:06:57,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:06:57,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:06:57,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:06:57,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:06:57,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:06:57,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:06:57,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:06:57,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:06:57,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:06:57,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:06:57,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:06:57,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:06:57,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:06:57,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:06:57,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:06:57,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:06:57,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:06:57,024 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:06:57,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:06:57,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:06:57,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:06:57,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:06:57,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:06:57,027 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:06:57,044 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:06:57,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:06:57,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:06:57,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:06:57,046 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:06:57,046 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:06:57,046 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:06:57,047 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:06:57,047 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:06:57,047 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:06:57,047 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:06:57,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:06:57,047 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:06:57,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:06:57,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:06:57,049 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:06:57,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:06:57,049 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:06:57,049 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:06:57,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:06:57,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:06:57,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:06:57,050 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:06:57,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:06:57,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:06:57,051 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:06:57,052 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:06:57,052 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 -> 1e89048ccdb20a97a14cb213e125edb5cbe6d123 [2019-01-14 03:06:57,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:06:57,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:06:57,104 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:06:57,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:06:57,106 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:06:57,107 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2019-01-14 03:06:57,172 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cf30c1f/119afe9a0f65401ea1360deff32d25af/FLAG16c77637b [2019-01-14 03:06:57,731 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:06:57,732 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label39_true-unreach-call_false-termination.c [2019-01-14 03:06:57,743 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cf30c1f/119afe9a0f65401ea1360deff32d25af/FLAG16c77637b [2019-01-14 03:06:57,970 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00cf30c1f/119afe9a0f65401ea1360deff32d25af [2019-01-14 03:06:57,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:06:57,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:06:57,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:06:57,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:06:57,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:06:57,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:57" (1/1) ... [2019-01-14 03:06:57,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a6a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:57, skipping insertion in model container [2019-01-14 03:06:57,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:06:57" (1/1) ... [2019-01-14 03:06:57,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:06:58,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:06:58,538 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:06:58,546 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:06:58,660 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:06:58,677 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:06:58,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58 WrapperNode [2019-01-14 03:06:58,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:06:58,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:06:58,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:06:58,679 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:06:58,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:06:58,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:06:58,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:06:58,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:06:58,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... [2019-01-14 03:06:58,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:06:58,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:06:58,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:06:58,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:06:58,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:06:59,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:06:59,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:07:02,319 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:07:02,319 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 03:07:02,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:02 BoogieIcfgContainer [2019-01-14 03:07:02,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:07:02,321 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:07:02,322 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:07:02,325 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:07:02,326 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:02,327 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:06:57" (1/3) ... [2019-01-14 03:07:02,328 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fce5fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:02, skipping insertion in model container [2019-01-14 03:07:02,328 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:02,328 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:06:58" (2/3) ... [2019-01-14 03:07:02,329 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fce5fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:02, skipping insertion in model container [2019-01-14 03:07:02,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:02,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:02" (3/3) ... [2019-01-14 03:07:02,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label39_true-unreach-call_false-termination.c [2019-01-14 03:07:02,389 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:07:02,390 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:07:02,390 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:07:02,390 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:07:02,390 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:07:02,391 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:07:02,391 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:07:02,391 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:07:02,391 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:07:02,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:02,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:02,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:02,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:02,466 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:02,466 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:02,467 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:07:02,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:02,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:02,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:02,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:02,479 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:02,479 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:02,486 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-01-14 03:07:02,487 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-01-14 03:07:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:07:02,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:02,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:02,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:02,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-14 03:07:02,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:02,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:02,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:02,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-14 03:07:02,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:02,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:02,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:02,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:03,441 WARN L181 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-14 03:07:03,517 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:03,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:03,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:03,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:03,519 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:03,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:03,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:03,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:03,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label39_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:03,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:03,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:03,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,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-14 03:07:03,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:03,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,264 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:04,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:04,348 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:04,364 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,364 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,386 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:04,408 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,409 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-14 03:07:04,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:04,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,440 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:07:04,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,481 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,497 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,497 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-14 03:07:04,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,552 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-14 03:07:04,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,570 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:07:04,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,620 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,634 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-14 03:07:04,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,667 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-14 03:07:04,682 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:04,682 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:04,703 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,728 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:04,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:04,759 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:04,760 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:04,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:04,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:04,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:04,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:04,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:04,762 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:04,762 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:04,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label39_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:04,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:04,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:04,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:04,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-14 03:07:05,229 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:07:05,417 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:05,784 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:07:05,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:05,793 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:05,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,820 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:05,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:05,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:05,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,955 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:05,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:05,960 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:05,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,971 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:05,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,973 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:05,976 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:05,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:05,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:05,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:05,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:05,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:05,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:05,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:05,997 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,001 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,012 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,012 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,017 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:06,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,058 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,061 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,070 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,073 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,079 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,087 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,087 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,091 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,091 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:06,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,100 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:06,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,102 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,104 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,124 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,128 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:06,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,172 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,172 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,186 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,210 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:06,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,219 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:06,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,220 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,223 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,241 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,241 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,249 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,250 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,253 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:06,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,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-14 03:07:06,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,285 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,286 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,301 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,302 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,307 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,307 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,313 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,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-14 03:07:06,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:06,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,322 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,323 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:06,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,330 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:06,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,332 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,357 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,358 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,365 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,370 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:06,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,427 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,439 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,440 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,444 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,445 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,445 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,454 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,454 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:06,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,458 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:06,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:06,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,467 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:06,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,468 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,472 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,474 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,497 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,497 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,506 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,506 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,510 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:06,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,545 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,546 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,547 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,555 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,566 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,567 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,578 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,581 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,587 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:06,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,593 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:06,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,606 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:06,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-14 03:07:06,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,607 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,611 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,616 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,635 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,640 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,653 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,668 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:06,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,755 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,766 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,782 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,785 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,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-14 03:07:06,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,794 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,797 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,805 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,805 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,806 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:06,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,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-14 03:07:06,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,812 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:06,818 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:06,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,832 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:06,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,860 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,869 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,870 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:06,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,873 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:06,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,899 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,916 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,917 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,918 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,925 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,926 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:06,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,945 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:06,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:06,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:06,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:06,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:06,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:06,959 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:06,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:06,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:06,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:06,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:06,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:06,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:06,963 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:06,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:06,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:07,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:07,036 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:07,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:07,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,045 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:07,046 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,049 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 03:07:07,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:07,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:07,227 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:07,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:07,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,241 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:07,242 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:07,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:07,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:07,248 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:07,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,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-14 03:07:07,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:07,254 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:07,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,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-14 03:07:07,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:07,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:07,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:07,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:07,264 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:07,266 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:07,268 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:07,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:07,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:07,314 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-14 03:07:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:09,228 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-14 03:07:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:09,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-14 03:07:09,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-14 03:07:09,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-14 03:07:09,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-14 03:07:09,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-14 03:07:09,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-14 03:07:09,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:09,257 INFO L706 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-14 03:07:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-14 03:07:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-14 03:07:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 03:07:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-14 03:07:09,306 INFO L729 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:09,307 INFO L609 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:09,307 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:07:09,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-14 03:07:09,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-14 03:07:09,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:09,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:09,310 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:09,310 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:09,310 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2019-01-14 03:07:09,311 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2019-01-14 03:07:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:07:09,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:09,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-14 03:07:09,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:09,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:09,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:09,335 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-14 03:07:09,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:09,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:09,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:09,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:09,807 WARN L181 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-14 03:07:09,848 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:09,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:09,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:09,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:09,849 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:09,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:09,852 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:09,852 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:09,852 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label39_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:09,852 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:09,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:09,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:09,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:10,140 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,154 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:10,154 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:10,179 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,213 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:10,214 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:10,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:10,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:10,367 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:10,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:10,424 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:10,425 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:10,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:10,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:10,426 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:10,426 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:10,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:10,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:10,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:10,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label39_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:10,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:10,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:10,782 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:07:10,895 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:10,896 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:10,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:10,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,900 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,900 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:10,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:10,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,905 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,908 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:10,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:10,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:10,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,917 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:10,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,919 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:10,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,921 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,921 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:10,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,923 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:10,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,925 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:10,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,927 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:10,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:10,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,936 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,937 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:10,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:10,941 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:10,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,943 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:10,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,947 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,947 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:10,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,949 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,949 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,954 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,954 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:10,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,958 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,959 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:10,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,965 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,966 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:10,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:10,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,973 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:10,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,975 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:10,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,978 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,978 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,978 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:10,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,980 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:10,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,982 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,982 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:10,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,985 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,986 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:10,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:10,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,991 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:10,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:10,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:10,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:10,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:10,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:10,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:10,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:10,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:10,999 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:10,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:11,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,004 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,005 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,007 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:11,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,009 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:11,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,012 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,013 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,015 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:11,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,022 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,023 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:11,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,030 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,044 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,067 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,068 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:11,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:11,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:11,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,095 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:11,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,096 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,105 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,105 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,105 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,105 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,109 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,113 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,114 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,114 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,116 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,122 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,122 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,129 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,133 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,149 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,150 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,152 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,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-14 03:07:11,167 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,167 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,168 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,169 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,178 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:11,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,179 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,184 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:11,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,185 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,185 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,186 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,192 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,192 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,194 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:11,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,196 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,196 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,197 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,199 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,199 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,200 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,206 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,206 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,208 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:11,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,238 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,238 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,258 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:11,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,291 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,292 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,294 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,305 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,306 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:11,308 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:11,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,316 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:11,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,317 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,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-14 03:07:11,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,322 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,322 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,326 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,326 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,329 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,333 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,333 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,333 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,334 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,349 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,349 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,354 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:11,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,370 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,370 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,373 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:11,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:11,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:11,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,404 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:11,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,405 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,405 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,411 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,411 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,413 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:11,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,416 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,416 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,420 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,421 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,425 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,426 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,426 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,434 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:11,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,458 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,459 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,462 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:11,462 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,468 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:11,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,512 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:11,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:11,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:11,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:11,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:11,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:11,561 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:11,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:11,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:11,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:11,581 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-14 03:07:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:12,861 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-14 03:07:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:12,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-14 03:07:12,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:12,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:12,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-14 03:07:12,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-14 03:07:12,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-14 03:07:12,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:12,879 INFO L706 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-14 03:07:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-14 03:07:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-14 03:07:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:12,907 INFO L729 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:12,907 INFO L609 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:12,907 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:07:12,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-14 03:07:12,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:12,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:12,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:12,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:12,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:12,913 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2019-01-14 03:07:12,915 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2019-01-14 03:07:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 03:07:12,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:12,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-14 03:07:12,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:12,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:13,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:13,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:07:13,255 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:07:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:07:13,256 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-14 03:07:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:14,852 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-14 03:07:14,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:07:14,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:14,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-14 03:07:14,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-14 03:07:14,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-14 03:07:14,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-14 03:07:14,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:14,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:14,878 INFO L706 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-14 03:07:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-14 03:07:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-14 03:07:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-14 03:07:14,932 INFO L729 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:14,932 INFO L609 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:14,932 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:07:14,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-14 03:07:14,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-14 03:07:14,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:14,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:14,942 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:14,942 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:14,942 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2019-01-14 03:07:14,944 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2019-01-14 03:07:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 03:07:14,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:14,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:14,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-14 03:07:14,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:14,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:14,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:14,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:07:15,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:15,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:15,059 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:15,059 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-14 03:07:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:15,890 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-14 03:07:15,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:15,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:15,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:15,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:15,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-14 03:07:15,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-14 03:07:15,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:15,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:15,921 INFO L706 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-14 03:07:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-14 03:07:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:15,946 INFO L729 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:15,946 INFO L609 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:15,946 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:07:15,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:15,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:15,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:15,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:15,960 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:15,960 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:15,961 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2019-01-14 03:07:15,961 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2019-01-14 03:07:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-14 03:07:15,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:15,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:15,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-14 03:07:15,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:15,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:15,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:07:16,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:16,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:16,071 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:16,073 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-14 03:07:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:17,568 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-14 03:07:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:17,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:17,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:17,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:17,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-14 03:07:17,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-14 03:07:17,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:17,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:17,590 INFO L706 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-14 03:07:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-14 03:07:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:17,612 INFO L729 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:17,612 INFO L609 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:17,612 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:07:17,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:17,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:17,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:17,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:17,621 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:17,621 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:17,621 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2019-01-14 03:07:17,624 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2019-01-14 03:07:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-14 03:07:17,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:17,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:17,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-14 03:07:17,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:17,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:17,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:17,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:17,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:17,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:17,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:17,775 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:17,777 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-14 03:07:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:18,091 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-14 03:07:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:18,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:18,101 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:18,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:18,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-14 03:07:18,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-14 03:07:18,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:18,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:18,112 INFO L706 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-14 03:07:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-14 03:07:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:18,132 INFO L729 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:18,132 INFO L609 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:18,132 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:07:18,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:18,138 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:18,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:18,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:18,139 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:18,139 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:18,140 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2019-01-14 03:07:18,144 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2019-01-14 03:07:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-14 03:07:18,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:18,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-14 03:07:18,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-14 03:07:18,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:18,549 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:07:18,878 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-14 03:07:19,444 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-14 03:07:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:07:19,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:19,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 03:07:21,610 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-14 03:07:21,754 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 03:07:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 03:07:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 03:07:21,761 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-14 03:07:22,609 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 03:07:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:23,118 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-14 03:07:23,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:07:23,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-14 03:07:23,128 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:23,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-14 03:07:23,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-14 03:07:23,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-14 03:07:23,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:23,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:23,144 INFO L706 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-14 03:07:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-14 03:07:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-14 03:07:23,166 INFO L729 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:23,166 INFO L609 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:23,166 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:07:23,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:23,175 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:23,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:23,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:23,175 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:07:23,176 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:23,176 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2019-01-14 03:07:23,176 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2019-01-14 03:07:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-14 03:07:23,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:23,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:23,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-14 03:07:23,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:23,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:23,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-14 03:07:23,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:23,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:23,451 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-14 03:07:23,612 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-14 03:07:23,663 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:23,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:23,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:23,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:23,663 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:23,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:23,666 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:23,666 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:23,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label39_true-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-14 03:07:23,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:23,667 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:23,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,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-14 03:07:23,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:23,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-14 03:07:24,096 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:24,096 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,105 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,105 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,129 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,175 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,175 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,241 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,296 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,299 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,299 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,324 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,349 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-14 03:07:24,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,373 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,399 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,429 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-14 03:07:24,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,453 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,480 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,480 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,503 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,504 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,525 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:24,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,780 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,804 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,804 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:24,828 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:24,828 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:24,850 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:24,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:24,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:25,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:25,048 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:25,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:25,072 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:25,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:25,075 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:25,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:25,096 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:25,099 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:25,100 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-14 03:07:25,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:07:25 BoogieIcfgContainer [2019-01-14 03:07:25,168 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:07:25,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:07:25,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:07:25,171 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:07:25,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:02" (3/4) ... [2019-01-14 03:07:25,175 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:07:25,233 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:07:25,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:07:25,234 INFO L168 Benchmark]: Toolchain (without parser) took 27259.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 442.0 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -260.9 MB). Peak memory consumption was 181.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,237 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:07:25,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,239 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -219.4 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,239 INFO L168 Benchmark]: Boogie Preprocessor took 95.35 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,243 INFO L168 Benchmark]: RCFGBuilder took 3367.99 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,244 INFO L168 Benchmark]: BuchiAutomizer took 22846.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.8 MB). Peak memory consumption was 488.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:25,244 INFO L168 Benchmark]: Witness Printer took 64.80 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-14 03:07:25,248 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 700.11 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 178.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -219.4 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.35 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3367.99 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22846.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 290.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.8 MB). Peak memory consumption was 488.3 MB. Max. memory is 11.5 GB. * Witness Printer took 64.80 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 22.7s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.3s. Construction of modules took 7.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s 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.1s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 182ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4656b1d2=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27993fd4=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@4656b1d2=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27993fd4=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@4656b1d2=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@27993fd4=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...