./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label59_false-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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:25:17,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:25:17,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:25:17,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:25:17,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:25:17,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:25:17,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:25:17,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:25:17,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:25:17,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:25:17,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:25:17,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:25:17,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:25:17,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:25:17,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:25:17,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:25:17,279 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:25:17,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:25:17,286 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:25:17,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:25:17,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:25:17,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:25:17,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:25:17,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:25:17,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:25:17,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:25:17,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:25:17,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:25:17,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:25:17,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:25:17,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:25:17,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:25:17,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:25:17,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:25:17,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:25:17,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:25:17,317 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:25:17,344 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:25:17,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:25:17,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:25:17,345 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:25:17,346 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:25:17,347 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:25:17,348 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:25:17,348 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:25:17,348 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:25:17,348 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:25:17,348 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:25:17,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:25:17,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:25:17,350 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:25:17,351 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:25:17,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:25:17,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:25:17,352 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:25:17,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:25:17,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:25:17,353 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:25:17,354 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:25:17,354 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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2019-01-01 22:25:17,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:25:17,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:25:17,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:25:17,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:25:17,425 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:25:17,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2019-01-01 22:25:17,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828aaed88/507f5f17b3b34c9ead982c6688030e4c/FLAGb95c49ba1 [2019-01-01 22:25:17,995 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:25:17,996 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2019-01-01 22:25:18,008 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828aaed88/507f5f17b3b34c9ead982c6688030e4c/FLAGb95c49ba1 [2019-01-01 22:25:18,271 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/828aaed88/507f5f17b3b34c9ead982c6688030e4c [2019-01-01 22:25:18,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:25:18,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:25:18,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:25:18,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:25:18,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:25:18,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:25:18" (1/1) ... [2019-01-01 22:25:18,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@540addd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:18, skipping insertion in model container [2019-01-01 22:25:18,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:25:18" (1/1) ... [2019-01-01 22:25:18,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:25:18,372 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:25:18,849 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:25:18,859 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:25:18,999 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:25:19,018 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:25:19,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19 WrapperNode [2019-01-01 22:25:19,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:25:19,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:25:19,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:25:19,020 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:25:19,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:25:19,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:25:19,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:25:19,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:25:19,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... [2019-01-01 22:25:19,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:25:19,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:25:19,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:25:19,283 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:25:19,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:19,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:25:19,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:25:22,849 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:25:22,849 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 22:25:22,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:25:22 BoogieIcfgContainer [2019-01-01 22:25:22,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:25:22,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:25:22,852 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:25:22,855 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:25:22,856 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:25:22,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:25:18" (1/3) ... [2019-01-01 22:25:22,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd0b8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:25:22, skipping insertion in model container [2019-01-01 22:25:22,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:25:22,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:25:19" (2/3) ... [2019-01-01 22:25:22,858 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cd0b8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:25:22, skipping insertion in model container [2019-01-01 22:25:22,858 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:25:22,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:25:22" (3/3) ... [2019-01-01 22:25:22,860 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label59_false-unreach-call_false-termination.c [2019-01-01 22:25:22,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:25:22,922 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:25:22,922 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:25:22,922 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:25:22,922 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:25:22,923 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:25:22,924 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:25:22,924 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:25:22,924 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:25:22,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:25:23,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:25:23,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:23,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:23,031 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:23,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:25:23,032 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:25:23,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-01-01 22:25:23,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-01-01 22:25:23,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:23,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:23,047 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:23,047 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:25:23,057 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-01-01 22:25:23,058 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-01-01 22:25:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:25:23,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:23,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-01-01 22:25:23,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:23,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:23,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-01-01 22:25:23,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:23,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:25:23,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:23,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:25:24,042 WARN L181 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-01-01 22:25:24,164 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 22:25:24,176 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:25:24,177 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:25:24,177 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:25:24,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:25:24,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:25:24,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:24,179 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:25:24,179 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:25:24,179 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:25:24,179 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:25:24,179 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:25:24,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,332 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-01 22:25:24,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,548 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 22:25:24,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:24,986 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:25:25,073 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:25,074 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:25,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:25,123 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,123 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:25:25,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,164 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,178 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:25:25,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,226 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,238 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,239 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:25,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,329 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:25:25,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,365 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,373 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:25,409 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:25,410 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:25,432 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:25,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:25,496 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:25:25,498 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:25:25,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:25:25,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:25:25,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:25:25,499 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:25:25,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:25,499 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:25:25,499 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:25:25,499 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration1_Loop [2019-01-01 22:25:25,499 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:25:25,499 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:25:25,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:25,993 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:25:26,262 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 22:25:26,651 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:25:26,654 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:26,665 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:25:26,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,734 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:26,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:26,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,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-01 22:25:26,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:26,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:26,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:26,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:26,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,887 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:25:26,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,892 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,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-01 22:25:26,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,905 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,912 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:26,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,915 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:25:26,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,948 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,973 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,975 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,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-01 22:25:26,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:26,981 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,983 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:26,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:26,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:26,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:26,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:26,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:26,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:26,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:26,990 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:26,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:26,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,005 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:25:27,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-01 22:25:27,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,029 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,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-01 22:25:27,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,035 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,038 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:27,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,064 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,065 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,072 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,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-01 22:25:27,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,085 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:27,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,093 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:25:27,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,098 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,107 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,116 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,116 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,119 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:25:27,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,136 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,139 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,145 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,154 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,159 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,159 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:27,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,164 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,167 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:27,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,174 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:25:27,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,175 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,175 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,179 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,199 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,200 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,206 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,206 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,211 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-01-01 22:25:27,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,245 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,245 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,248 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,249 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,266 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,266 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,269 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,269 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,275 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,276 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,276 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:27,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,282 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,285 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:27,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,294 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:25:27,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,295 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,299 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,301 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,320 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,322 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,332 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,332 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,332 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,337 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:27,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,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-01 22:25:27,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,395 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,405 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,410 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,416 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,425 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:27,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,426 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,430 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:27,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,442 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:25:27,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,443 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,447 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,450 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,466 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,469 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,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-01 22:25:27,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,479 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,482 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,489 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-01-01 22:25:27,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,549 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,550 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,554 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,569 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,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-01 22:25:27,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,577 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,582 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,590 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,590 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,591 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:27,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,597 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,598 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:27,604 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:27,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,619 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:25:27,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-01 22:25:27,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,620 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,640 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,640 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,648 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,648 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,648 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,654 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:27,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,680 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,682 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,693 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,694 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,702 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,703 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,705 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,713 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,715 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:27,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,720 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:27,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:27,720 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:27,721 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:27,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,733 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:25:27,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,735 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,782 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,785 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,795 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,795 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:25:27,796 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,801 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-01-01 22:25:27,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,965 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,976 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,976 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:27,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:27,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:27,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:27,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:27,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:27,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:27,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:27,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:27,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:27,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:28,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:28,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:28,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:28,005 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:28,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:28,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:28,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:28,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:28,010 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:28,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:28,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:28,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:25:28,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:25:28,048 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-01-01 22:25:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:30,019 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2019-01-01 22:25:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:25:30,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2019-01-01 22:25:30,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2019-01-01 22:25:30,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2019-01-01 22:25:30,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2019-01-01 22:25:30,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2019-01-01 22:25:30,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2019-01-01 22:25:30,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:30,070 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-01 22:25:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2019-01-01 22:25:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-01 22:25:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-01 22:25:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-01-01 22:25:30,121 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:25:30,121 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-01-01 22:25:30,121 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:25:30,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-01-01 22:25:30,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-01-01 22:25:30,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:30,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:30,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:30,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:30,126 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2019-01-01 22:25:30,126 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2019-01-01 22:25:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 22:25:30,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:30,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-01-01 22:25:30,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:25:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-01-01 22:25:30,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:25:30,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:30,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:25:30,622 WARN L181 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-01-01 22:25:30,659 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:25:30,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:25:30,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:25:30,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:25:30,660 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:25:30,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:30,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:25:30,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:25:30,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:25:30,661 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:25:30,661 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:25:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:30,935 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:30,935 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:30,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:30,941 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:30,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:30,945 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:30,973 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:30,973 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:30,977 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:30,977 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:30,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:30,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:31,007 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:31,007 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:31,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:31,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:31,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:31,032 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:31,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:31,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:31,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:31,148 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:31,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:31,172 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:31,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:31,197 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:31,228 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:25:31,230 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:25:31,230 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:25:31,230 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:25:31,230 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:25:31,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:25:31,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:31,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:25:31,231 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:25:31,231 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration2_Loop [2019-01-01 22:25:31,231 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:25:31,231 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:25:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:31,625 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:25:31,730 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:31,731 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:25:31,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-01 22:25:31,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:31,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,740 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,743 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:31,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:31,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,753 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:31,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:25:31,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:25:31,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,765 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:25:31,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,767 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,769 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,769 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,771 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,771 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,773 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,773 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,775 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,778 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,784 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,784 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,788 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,790 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:25:31,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,799 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,799 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:31,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,813 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:31,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,822 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:31,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:31,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:31,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,853 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:25:31,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,858 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,858 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:31,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,863 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,864 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:31,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,868 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,869 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:31,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,876 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,876 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:31,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,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-01 22:25:31,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,883 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,883 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:31,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,896 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,897 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:31,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,912 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,913 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:31,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:25:31,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:31,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:31,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,929 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:25:31,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,930 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,938 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,938 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,940 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,941 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,945 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,947 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,953 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,953 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25: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-01 22:25:31,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,966 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,967 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:31,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:31,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:31,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:31,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:31,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:31,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:31,985 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:31,986 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:31,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,008 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:25:32,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:25:32,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,014 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:25:32,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,014 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,026 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,027 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,028 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,035 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,039 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,042 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,043 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,046 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,048 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,056 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,058 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,085 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:25:32,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,092 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:25:32,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:32,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,104 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,106 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:32,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,108 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,109 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,110 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:32,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,113 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:32,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,121 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,123 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:32,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,141 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,141 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,142 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,142 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,151 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-01 22:25:32,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,173 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,177 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:32,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,210 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,210 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:25:32,217 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:25:32,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,233 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:25:32,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,234 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,235 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,236 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,243 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,244 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,250 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,251 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,256 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,266 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,266 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,266 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,282 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,284 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:25:32,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,304 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,304 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,308 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,309 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,328 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:25:32,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,328 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:25:32,332 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:25:32,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,338 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:25:32,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,343 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,343 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:32,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,351 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,351 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,355 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:32,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,361 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,361 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:32,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,370 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,375 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:32,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,383 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,383 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:32,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,420 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:25:32,420 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,428 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:25:32,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,476 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,476 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:32,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:25:32,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:25:32,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:25:32,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:25:32,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:25:32,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:25:32,517 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:25:32,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:25:32,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:25:32,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:25:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:25:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:25:32,531 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-01-01 22:25:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:33,843 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-01-01 22:25:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:25:33,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-01-01 22:25:33,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:25:33,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:25:33,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-01-01 22:25:33,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-01-01 22:25:33,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-01-01 22:25:33,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:33,862 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:25:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-01-01 22:25:33,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-01-01 22:25:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-01-01 22:25:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-01-01 22:25:33,887 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:25:33,887 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-01-01 22:25:33,887 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:25:33,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-01-01 22:25:33,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-01-01 22:25:33,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:33,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:33,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:33,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:33,893 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2019-01-01 22:25:33,894 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2019-01-01 22:25:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-01-01 22:25:33,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:33,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2019-01-01 22:25:33,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:33,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:33,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:33,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:25:33,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:25:34,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:25:34,071 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:25:34,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:25:34,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:25:34,071 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-01-01 22:25:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:35,372 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2019-01-01 22:25:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:25:35,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2019-01-01 22:25:35,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2019-01-01 22:25:35,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2019-01-01 22:25:35,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2019-01-01 22:25:35,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2019-01-01 22:25:35,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2019-01-01 22:25:35,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:35,399 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2019-01-01 22:25:35,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2019-01-01 22:25:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2019-01-01 22:25:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-01-01 22:25:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2019-01-01 22:25:35,433 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:25:35,433 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2019-01-01 22:25:35,433 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:25:35,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2019-01-01 22:25:35,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2019-01-01 22:25:35,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:35,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:35,447 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:35,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:35,448 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2019-01-01 22:25:35,449 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2019-01-01 22:25:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-01-01 22:25:35,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:35,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:35,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:35,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:35,469 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-01-01 22:25:35,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:35,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:35,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:35,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:25:35,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:25:35,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:35,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:25:35,580 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:25:35,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:25:35,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:25:35,581 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2019-01-01 22:25:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:36,488 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2019-01-01 22:25:36,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:25:36,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2019-01-01 22:25:36,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:25:36,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:25:36,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2019-01-01 22:25:36,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2019-01-01 22:25:36,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2019-01-01 22:25:36,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:36,518 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:25:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2019-01-01 22:25:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2019-01-01 22:25:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-01-01 22:25:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2019-01-01 22:25:36,545 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:25:36,545 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2019-01-01 22:25:36,545 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:25:36,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2019-01-01 22:25:36,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:25:36,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:36,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:36,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:36,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:36,562 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2019-01-01 22:25:36,562 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2019-01-01 22:25:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-01-01 22:25:36,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:36,587 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2019-01-01 22:25:36,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:36,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:36,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:25:36,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:25:36,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:36,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:25:36,696 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:25:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:25:36,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:25:36,696 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2019-01-01 22:25:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:37,724 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2019-01-01 22:25:37,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:25:37,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2019-01-01 22:25:37,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:25:37,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:25:37,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2019-01-01 22:25:37,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2019-01-01 22:25:37,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2019-01-01 22:25:37,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:37,750 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:25:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2019-01-01 22:25:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-01-01 22:25:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-01-01 22:25:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2019-01-01 22:25:37,773 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:25:37,773 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2019-01-01 22:25:37,773 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:25:37,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2019-01-01 22:25:37,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2019-01-01 22:25:37,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:37,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:37,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:37,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:37,783 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2019-01-01 22:25:37,784 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2019-01-01 22:25:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-01-01 22:25:37,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:37,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:37,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2019-01-01 22:25:37,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:37,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:37,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:25:37,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:25:38,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:25:38,029 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:25:38,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:25:38,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:25:38,030 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2019-01-01 22:25:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:39,246 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2019-01-01 22:25:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:25:39,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2019-01-01 22:25:39,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:25:39,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:25:39,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2019-01-01 22:25:39,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2019-01-01 22:25:39,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2019-01-01 22:25:39,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:39,278 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:25:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2019-01-01 22:25:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2019-01-01 22:25:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-01-01 22:25:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2019-01-01 22:25:39,300 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:25:39,301 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2019-01-01 22:25:39,301 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:25:39,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2019-01-01 22:25:39,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2019-01-01 22:25:39,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:39,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:39,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:25:39,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:39,313 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2019-01-01 22:25:39,319 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2019-01-01 22:25:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:39,320 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-01-01 22:25:39,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:39,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:39,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:39,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-01-01 22:25:39,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:39,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:39,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-01-01 22:25:39,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:39,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:25:39,724 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 22:25:40,080 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 22:25:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:25:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:25:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 22:25:42,111 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-01-01 22:25:42,311 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:25:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:25:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:25:42,316 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2019-01-01 22:25:43,028 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-01 22:25:43,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:25:43,501 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2019-01-01 22:25:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:25:43,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2019-01-01 22:25:43,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:25:43,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2019-01-01 22:25:43,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2019-01-01 22:25:43,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2019-01-01 22:25:43,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2019-01-01 22:25:43,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:25:43,533 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:25:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2019-01-01 22:25:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2019-01-01 22:25:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-01-01 22:25:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2019-01-01 22:25:43,555 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:25:43,555 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2019-01-01 22:25:43,555 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:25:43,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2019-01-01 22:25:43,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2019-01-01 22:25:43,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:25:43,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:25:43,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:25:43,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:25:43,565 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2019-01-01 22:25:43,565 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2019-01-01 22:25:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-01-01 22:25:43,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:43,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-01-01 22:25:43,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:43,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:43,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:25:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-01-01 22:25:43,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:25:43,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:25:43,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:25:43,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:25:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:25:43,832 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2019-01-01 22:25:43,988 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-01 22:25:44,040 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:25:44,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:25:44,040 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:25:44,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:25:44,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:25:44,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:25:44,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:25:44,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label59_false-unreach-call_false-termination.c_Iteration8_Lasso [2019-01-01 22:25:44,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:25:44,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:25:44,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,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-01 22:25:44,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:25:44,479 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:25:44,479 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,540 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,676 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,677 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,698 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,701 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,701 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,747 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,751 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,751 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,799 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,826 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,827 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,859 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,883 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,883 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:44,906 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:44,906 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:44,929 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:44,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:44,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:45,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,215 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:45,244 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:45,268 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:25:45,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:45,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,494 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:25:45,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:25:45,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:25:45,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:25:45,519 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-01-01 22:25:45,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:25:45 BoogieIcfgContainer [2019-01-01 22:25:45,576 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:25:45,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:25:45,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:25:45,577 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:25:45,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:25:22" (3/4) ... [2019-01-01 22:25:45,583 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 22:25:45,651 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 22:25:45,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:25:45,653 INFO L168 Benchmark]: Toolchain (without parser) took 27376.74 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 436.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -267.5 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,654 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:25:45,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 186.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,657 INFO L168 Benchmark]: Boogie Preprocessor took 76.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,658 INFO L168 Benchmark]: RCFGBuilder took 3568.19 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: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,658 INFO L168 Benchmark]: BuchiAutomizer took 22724.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 495.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:25:45,659 INFO L168 Benchmark]: Witness Printer took 75.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:25:45,670 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.15 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 739.50 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 919.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 186.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 919.2 MB in the beginning and 1.1 GB in the end (delta: -208.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3568.19 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: 99.4 MB). Peak memory consumption was 99.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22724.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 495.5 MB. Max. memory is 11.5 GB. * Witness Printer took 75.17 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.6s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 13.0s. Construction of modules took 7.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s 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: 134ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@633710ea=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62f99f52=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@633710ea=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62f99f52=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@633710ea=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@62f99f52=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...