./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label51_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_label51_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 89e4d3b83e9299d0f8112c95fd72ee254e8bb8bf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:23,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:07:23,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:07:23,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:07:23,109 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:07:23,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:07:23,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:07:23,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:07:23,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:07:23,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:07:23,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:07:23,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:07:23,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:07:23,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:07:23,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:07:23,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:07:23,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:07:23,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:07:23,146 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:07:23,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:07:23,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:07:23,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:07:23,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:07:23,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:07:23,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:07:23,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:07:23,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:07:23,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:07:23,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:07:23,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:07:23,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:07:23,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:07:23,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:07:23,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:07:23,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:07:23,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:07:23,175 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:07:23,210 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:07:23,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:07:23,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:07:23,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:07:23,215 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:07:23,215 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:07:23,215 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:07:23,216 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:07:23,216 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:07:23,216 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:07:23,216 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:07:23,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:07:23,217 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:07:23,217 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:07:23,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:07:23,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:07:23,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:07:23,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:07:23,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:07:23,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:07:23,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:07:23,221 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:07:23,221 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:07:23,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:07:23,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:07:23,222 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:07:23,224 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:07:23,224 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 -> 89e4d3b83e9299d0f8112c95fd72ee254e8bb8bf [2019-01-14 03:07:23,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:07:23,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:07:23,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:07:23,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:07:23,295 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:07:23,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2019-01-14 03:07:23,354 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86988404/d0dae1033c254bb7bfd7c3d5fa3f88e7/FLAG8c1db7b28 [2019-01-14 03:07:23,929 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:07:23,936 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label51_true-unreach-call_false-termination.c [2019-01-14 03:07:23,949 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86988404/d0dae1033c254bb7bfd7c3d5fa3f88e7/FLAG8c1db7b28 [2019-01-14 03:07:24,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86988404/d0dae1033c254bb7bfd7c3d5fa3f88e7 [2019-01-14 03:07:24,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:07:24,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:07:24,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:07:24,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:07:24,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:07:24,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:24,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6072af91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24, skipping insertion in model container [2019-01-14 03:07:24,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:24,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:07:24,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:07:24,705 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:07:24,714 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:07:24,827 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:07:24,844 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:07:24,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24 WrapperNode [2019-01-14 03:07:24,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:07:24,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:07:24,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:07:24,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:07:24,855 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:07:24" (1/1) ... [2019-01-14 03:07:24,945 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:07:24" (1/1) ... [2019-01-14 03:07:25,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:07:25,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:07:25,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:07:25,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:07:25,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (1/1) ... [2019-01-14 03:07:25,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:07:25,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:07:25,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:07:25,081 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:07:25,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (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:07:25,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:07:25,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:07:28,223 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:07:28,224 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 03:07:28,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:28 BoogieIcfgContainer [2019-01-14 03:07:28,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:07:28,226 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:07:28,226 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:07:28,229 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:07:28,230 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:28,230 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:07:24" (1/3) ... [2019-01-14 03:07:28,231 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1790d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:28, skipping insertion in model container [2019-01-14 03:07:28,231 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:28,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:07:24" (2/3) ... [2019-01-14 03:07:28,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1790d7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:07:28, skipping insertion in model container [2019-01-14 03:07:28,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:07:28,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:07:28" (3/3) ... [2019-01-14 03:07:28,234 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label51_true-unreach-call_false-termination.c [2019-01-14 03:07:28,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:07:28,292 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:07:28,292 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:07:28,292 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:07:28,292 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:07:28,293 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:07:28,293 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:07:28,293 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:07:28,293 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:07:28,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:28,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:28,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:28,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:28,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:28,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:28,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:07:28,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-14 03:07:28,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-14 03:07:28,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:28,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:28,384 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:28,386 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:07:28,395 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:28,396 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:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 03:07:28,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-14 03:07:28,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-14 03:07:28,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:28,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:28,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:28,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:28,738 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:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:29,558 WARN L181 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-14 03:07:29,660 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 03:07:29,672 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:29,673 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:29,673 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:29,673 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:29,674 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:29,674 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:29,675 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:29,675 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:29,675 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:29,675 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:29,676 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:29,705 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:29,712 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:29,769 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:29,788 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:29,792 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:29,818 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:29,820 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:29,831 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:30,169 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:30,254 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:30,255 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:30,263 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,263 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:30,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,273 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:30,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,302 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:30,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,324 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:30,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:30,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,483 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:30,553 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,553 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:30,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,566 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:30,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,603 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:30,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,617 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:30,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,651 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:30,665 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,665 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:30,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,701 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:30,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:30,718 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) [2019-01-14 03:07:30,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:30,753 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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:30,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:30,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:30,833 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:30,835 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:30,835 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:30,836 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:30,836 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:30,836 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:30,836 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:30,836 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:30,836 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:30,836 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration1_Loop [2019-01-14 03:07:30,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:30,838 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:30,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:30,892 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:30,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:30,948 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:30,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:30,963 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:30,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:30,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:31,358 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 03:07:31,523 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-14 03:07:31,825 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 03:07:31,828 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:31,834 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:31,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:31,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:31,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:31,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,868 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:31,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:31,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,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:31,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:31,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,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:31,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:31,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:31,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:31,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,967 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:31,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:31,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:31,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:31,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:31,980 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:31,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:31,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:31,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:31,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:31,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:31,984 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:31,988 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:31,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,011 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,017 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,024 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,024 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,029 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:32,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,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:32,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,071 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,071 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,082 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,082 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,087 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,089 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,096 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:32,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:32,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,098 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,109 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,113 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,118 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:32,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,145 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,145 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,156 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,163 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,163 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:32,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,169 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:32,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:32,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,172 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,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:32,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,185 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,185 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,193 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,194 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,196 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:32,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,217 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,218 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,224 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,225 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,229 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,233 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,234 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:32,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,236 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,236 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,237 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:32,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,243 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:32,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:32,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:32,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,248 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,252 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,281 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,281 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,281 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,282 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,295 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,295 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,296 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,300 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-14 03:07:32,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,346 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,347 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,354 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,360 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,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:32,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,365 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:32,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,367 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,367 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:32,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,374 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:32,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,376 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,395 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,395 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,402 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,402 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,405 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:32,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,449 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,449 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,450 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,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:32,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:32,458 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,463 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,464 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,465 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,471 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,471 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,472 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,475 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:32,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,476 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,478 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:32,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,489 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:32,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,490 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,491 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,517 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,524 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,525 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,525 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,537 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-14 03:07:32,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,594 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,595 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,599 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,611 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,613 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,620 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,624 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,631 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,631 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,632 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:32,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,638 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,638 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:32,644 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:32,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,656 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:32,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,675 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,676 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,685 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,685 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,710 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,736 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:32,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,743 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:32,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,744 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:32,745 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:32,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,758 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:32,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,761 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,763 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,806 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,807 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,817 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,820 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:07:32,820 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,826 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-14 03:07:32,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,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:32,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,937 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,956 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,961 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,966 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:32,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,971 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:32,971 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:32,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:32,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:32,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:32,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:32,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:32,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:32,977 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:32,978 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:32,979 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:32,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:32,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:33,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:33,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:33,008 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-14 03:07:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:34,770 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-14 03:07:34,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:34,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-14 03:07:34,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-14 03:07:34,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-14 03:07:34,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-14 03:07:34,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-14 03:07:34,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-14 03:07:34,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:34,803 INFO L706 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-14 03:07:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-14 03:07:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-14 03:07:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-14 03:07:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-14 03:07:34,847 INFO L729 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:34,847 INFO L609 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-14 03:07:34,847 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:07:34,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-14 03:07:34,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-14 03:07:34,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:34,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:34,850 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:34,851 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:34,851 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:34,851 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:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:34,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 03:07:34,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:34,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:34,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-14 03:07:34,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:34,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-14 03:07:34,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:34,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:34,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:34,929 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:34,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:34,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:07:35,327 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-14 03:07:35,404 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:35,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:35,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:35,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:35,405 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:35,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:35,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:35,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:35,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:35,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:35,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:35,409 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:35,421 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:35,427 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:35,429 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:35,432 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:35,434 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:35,439 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:35,447 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:35,655 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:35,655 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:35,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:35,662 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:35,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,688 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:35,688 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:35,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:35,784 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:35,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,807 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:35,808 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:35,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,830 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,846 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:35,846 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:35,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:35,870 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:35,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:35,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:35,923 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:07:35,924 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:35,924 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:35,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:35,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:35,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:07:35,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:35,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:35,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:35,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration2_Loop [2019-01-14 03:07:35,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:35,926 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:35,931 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:35,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:36,013 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:36,025 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:36,046 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:36,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:36,098 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:36,107 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:36,470 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:36,470 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:07:36,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:36,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:36,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:36,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,485 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,487 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:36,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:07:36,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:07:36,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,496 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 03:07:36,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:36,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,497 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,497 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,499 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,499 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,501 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,501 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,503 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,503 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,505 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,505 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,509 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,514 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,518 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,519 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 03:07:36,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,521 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,525 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,526 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,529 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,529 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,533 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,533 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,539 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,539 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,543 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,544 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,546 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 03:07:36,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,547 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,550 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,550 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,552 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,554 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,556 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,556 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,557 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,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:36,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,561 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,561 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,562 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:07:36,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,573 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,574 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,576 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 03:07:36,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,577 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,578 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,580 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,581 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,581 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,582 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,582 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,583 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,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:36,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,588 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,589 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,601 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,601 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:36,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,620 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,622 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 03:07:36,641 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 03:07:36,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,648 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 03:07:36,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,649 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,649 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,665 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,668 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,668 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,674 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,678 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,684 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,684 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,686 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,704 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,706 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,732 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,734 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,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:36,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:36,755 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 03:07:36,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,755 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,763 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 03:07:36,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,768 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,769 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,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:36,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:36,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,783 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,785 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,792 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,793 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,796 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,812 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,812 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,814 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,836 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,837 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,847 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-14 03:07:36,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,881 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,892 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:36,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,893 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 03:07:36,895 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 03:07:36,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,902 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 03:07:36,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,903 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,903 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,907 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,908 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,908 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,911 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,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:36,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,913 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,914 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,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:36,916 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,917 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,917 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,941 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,942 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:36,942 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,947 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:07:36,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:36,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,968 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:36,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:36,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:36,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:36,995 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 03:07:36,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:36,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:36,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:36,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 03:07:36,996 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:07:36,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,000 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 03:07:37,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:37,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,001 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:37,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:37,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:37,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,006 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:37,006 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,007 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:37,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,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:37,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:37,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:37,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:37,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,013 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:37,014 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:37,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,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:37,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:37,018 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,019 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:37,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:37,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,034 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,034 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:07:37,034 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,036 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 03:07:37,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:07:37,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,063 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:37,064 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:37,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict 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:37,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 03:07:37,115 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 03:07:37,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:07:37,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:07:37,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:07:37,119 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 03:07:37,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:07:37,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:07:37,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:07:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:37,135 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-14 03:07:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:38,667 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-14 03:07:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:38,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-14 03:07:38,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:38,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:38,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-14 03:07:38,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-14 03:07:38,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-14 03:07:38,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:38,687 INFO L706 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-14 03:07:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-14 03:07:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-14 03:07:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-14 03:07:38,720 INFO L729 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:38,720 INFO L609 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-14 03:07:38,720 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:07:38,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-14 03:07:38,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-14 03:07:38,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:38,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:38,725 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:38,726 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:38,726 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:38,727 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:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-14 03:07:38,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-14 03:07:38,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:38,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:38,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:38,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:38,919 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:38,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:38,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:07:38,920 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:38,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:07:38,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:07:38,921 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-14 03:07:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:40,454 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-14 03:07:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:07:40,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:40,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-14 03:07:40,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-14 03:07:40,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-14 03:07:40,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-14 03:07:40,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:40,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:40,479 INFO L706 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-14 03:07:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-14 03:07:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-14 03:07:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-14 03:07:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-14 03:07:40,522 INFO L729 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:40,522 INFO L609 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-14 03:07:40,522 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:07:40,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-14 03:07:40,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-14 03:07:40,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:40,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:40,532 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:40,535 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:40,535 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:40,535 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:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:40,536 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-14 03:07:40,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:40,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:40,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:40,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-14 03:07:40,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:40,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:40,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:40,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:40,636 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:40,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:40,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:40,637 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:40,638 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-14 03:07:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:41,528 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-14 03:07:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:41,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:41,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:41,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:41,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-14 03:07:41,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-14 03:07:41,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:41,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:41,561 INFO L706 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-14 03:07:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-14 03:07:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-14 03:07:41,586 INFO L729 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:41,586 INFO L609 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-14 03:07:41,586 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:07:41,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-14 03:07:41,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:41,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:41,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:41,601 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:41,602 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:41,602 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:41,602 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:41,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-14 03:07:41,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:41,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:41,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-14 03:07:41,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:41,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:41,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:41,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:41,718 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:41,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:41,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:41,719 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:41,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:41,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:41,720 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-14 03:07:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:42,877 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-14 03:07:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:42,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:42,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:42,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:42,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-14 03:07:42,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-14 03:07:42,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:42,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:42,903 INFO L706 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-14 03:07:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-14 03:07:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-14 03:07:42,929 INFO L729 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:42,929 INFO L609 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-14 03:07:42,929 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:07:42,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-14 03:07:42,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-14 03:07:42,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:42,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:42,942 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:42,945 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:42,945 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:42,946 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:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-14 03:07:42,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:42,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:42,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:42,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:42,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-14 03:07:42,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:42,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:42,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:07:42,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:43,209 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:43,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:43,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:07:43,210 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:07:43,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:07:43,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:07:43,210 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-14 03:07:44,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:44,304 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-14 03:07:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:07:44,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:44,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:44,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:44,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-14 03:07:44,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-14 03:07:44,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:44,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:44,330 INFO L706 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-14 03:07:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-14 03:07:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-14 03:07:44,353 INFO L729 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:44,353 INFO L609 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-14 03:07:44,353 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:07:44,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-14 03:07:44,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-14 03:07:44,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:44,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:44,365 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 03:07:44,365 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:44,365 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:44,376 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:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-14 03:07:44,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:44,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:44,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-14 03:07:44,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:44,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:44,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-14 03:07:44,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:44,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:07:44,760 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:07:45,158 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:45,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:07:45,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 03:07:46,573 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-14 03:07:46,715 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-14 03:07:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 03:07:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-14 03:07:46,726 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-14 03:07:47,452 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-14 03:07:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:07:48,033 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-14 03:07:48,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 03:07:48,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-14 03:07:48,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:48,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-14 03:07:48,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-14 03:07:48,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-14 03:07:48,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:48,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:07:48,064 INFO L706 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-14 03:07:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-14 03:07:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-14 03:07:48,084 INFO L729 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:48,084 INFO L609 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-14 03:07:48,084 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:07:48,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-14 03:07:48,093 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-14 03:07:48,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:07:48,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:07:48,094 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:07:48,094 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:07:48,094 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:48,094 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:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-14 03:07:48,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:48,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:48,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-14 03:07:48,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:48,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:07:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-14 03:07:48,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:07:48,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:07:48,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:07:48,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:07:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:07:48,711 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-14 03:07:48,867 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-14 03:07:48,923 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:07:48,924 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:07:48,924 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:07:48,924 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:07:48,924 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:07:48,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:07:48,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:07:48,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:07:48,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label51_true-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-14 03:07:48,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:07:48,925 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:07:48,928 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:48,937 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:48,944 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:48,951 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:48,958 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:48,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:48,966 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:48,972 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:48,974 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:48,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:07:48,981 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:48,984 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:48,986 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:48,990 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:48,994 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:48,997 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:49,010 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:49,023 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:49,026 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:49,035 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:49,043 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:49,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:07:49,310 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:49,316 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,319 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:49,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,342 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,343 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:49,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,385 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:49,408 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,408 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,412 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:49,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,439 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:49,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,466 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:49,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,490 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:49,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,514 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:49,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,541 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,541 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:49,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,566 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,566 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:49,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,591 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,592 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:49,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,617 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:49,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,646 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:49,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,670 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:49,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,694 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:49,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,718 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:49,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:49,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,957 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:49,977 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:49,977 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:49,981 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:49,981 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:50,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:50,000 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:50,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:50,004 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:50,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:50,024 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:50,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:07:50,047 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:50,215 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:50,215 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:50,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:50,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:50,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:50,240 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:50,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:07:50,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:07:50,263 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:07:50,263 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:50,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:07:50 BoogieIcfgContainer [2019-01-14 03:07:50,313 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:07:50,316 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:07:50,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:07:50,317 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:07:50,318 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:28" (3/4) ... [2019-01-14 03:07:50,324 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-14 03:07:50,382 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 03:07:50,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:07:50,384 INFO L168 Benchmark]: Toolchain (without parser) took 26228.50 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -288.5 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:50,385 INFO L168 Benchmark]: CDTParser took 0.22 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:50,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 916.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:50,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 162.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -212.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:50,389 INFO L168 Benchmark]: Boogie Preprocessor took 71.79 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:50,392 INFO L168 Benchmark]: RCFGBuilder took 3144.68 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: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:50,394 INFO L168 Benchmark]: BuchiAutomizer took 22087.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -231.3 MB). Peak memory consumption was 477.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:07:50,394 INFO L168 Benchmark]: Witness Printer took 66.98 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:50,400 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.22 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 687.39 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 916.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 162.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 916.5 MB in the beginning and 1.1 GB in the end (delta: -212.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.79 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 3144.68 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: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22087.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 293.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -231.3 MB). Peak memory consumption was 477.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.98 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.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 12.1s. Construction of modules took 7.5s. 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.5s 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: 115ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - 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@29024b31=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@936eaf4=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@29024b31=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@936eaf4=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@29024b31=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@936eaf4=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...