./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash ce8a7f5b0345c6213ba7b1864c5b0de301a874d7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:06:12,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:06:12,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:06:12,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:06:12,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:06:12,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:06:12,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:06:12,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:06:12,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:06:12,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:06:12,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:06:12,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:06:12,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:06:12,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:06:12,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:06:12,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:06:12,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:06:12,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:06:12,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:06:12,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:06:12,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:06:12,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:06:12,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:06:12,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:06:12,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:06:12,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:06:12,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:06:12,128 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:06:12,129 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:06:12,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:06:12,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:06:12,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:06:12,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:06:12,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:06:12,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:06:12,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:06:12,134 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:06:12,151 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:06:12,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:06:12,153 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:06:12,153 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:06:12,153 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:06:12,153 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:06:12,153 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:06:12,153 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:06:12,154 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:06:12,154 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:06:12,154 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:06:12,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:06:12,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:06:12,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:06:12,156 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:06:12,156 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:06:12,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:06:12,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:06:12,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:06:12,156 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:06:12,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:06:12,157 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:06:12,157 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:06:12,158 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:06:12,158 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce8a7f5b0345c6213ba7b1864c5b0de301a874d7 [2019-01-01 22:06:12,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:06:12,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:06:12,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:06:12,210 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:06:12,210 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:06:12,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i [2019-01-01 22:06:12,267 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215a84b3b/e08b84e9f36541df979e63251a85d1a8/FLAGfe2ed555a [2019-01-01 22:06:12,713 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:06:12,713 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i [2019-01-01 22:06:12,724 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215a84b3b/e08b84e9f36541df979e63251a85d1a8/FLAGfe2ed555a [2019-01-01 22:06:13,073 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215a84b3b/e08b84e9f36541df979e63251a85d1a8 [2019-01-01 22:06:13,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:06:13,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:06:13,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:13,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:06:13,087 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:06:13,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4e2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13, skipping insertion in model container [2019-01-01 22:06:13,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:06:13,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:06:13,354 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:13,367 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:06:13,395 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:06:13,418 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:06:13,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13 WrapperNode [2019-01-01 22:06:13,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:06:13,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:13,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:06:13,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:06:13,431 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:06:13" (1/1) ... [2019-01-01 22:06:13,442 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:06:13" (1/1) ... [2019-01-01 22:06:13,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:06:13,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:06:13,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:06:13,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:06:13,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (1/1) ... [2019-01-01 22:06:13,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:06:13,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:06:13,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:06:13,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:06:13,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (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:06:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:06:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:06:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-01 22:06:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-01 22:06:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-01 22:06:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-01 22:06:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:06:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:06:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:06:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:06:14,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:06:14,279 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:06:14,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:14 BoogieIcfgContainer [2019-01-01 22:06:14,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:06:14,280 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:06:14,280 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:06:14,285 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:06:14,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:14,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:06:13" (1/3) ... [2019-01-01 22:06:14,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f29da7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:14, skipping insertion in model container [2019-01-01 22:06:14,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:14,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:06:13" (2/3) ... [2019-01-01 22:06:14,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f29da7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:06:14, skipping insertion in model container [2019-01-01 22:06:14,289 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:06:14,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:06:14" (3/3) ... [2019-01-01 22:06:14,292 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5B_true-termination.c.i [2019-01-01 22:06:14,353 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:06:14,354 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:06:14,354 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:06:14,354 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:06:14,355 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:06:14,355 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:06:14,355 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:06:14,355 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:06:14,356 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:06:14,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 22:06:14,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:14,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:14,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:14,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:14,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:14,413 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:06:14,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 22:06:14,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:14,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:14,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:14,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:14,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:14,427 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 11#L76true assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 8#L76-2true assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 20#L79true call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 9#fENTRYtrue [2019-01-01 22:06:14,429 INFO L796 eck$LassoCheckResult]: Loop: 9#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 26#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 10#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 28#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 15#L47true assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 5#gFINALtrue assume true; 25#gEXITtrue >#53#return; 14#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 9#fENTRYtrue [2019-01-01 22:06:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 1 times [2019-01-01 22:06:14,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:14,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:14,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1039736561, now seen corresponding path program 1 times [2019-01-01 22:06:14,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:14,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:14,890 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:06:14,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:06:14,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:06:14,897 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:06:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:06:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:06:14,915 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 6 states. [2019-01-01 22:06:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:15,523 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-01-01 22:06:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:06:15,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-01-01 22:06:15,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:15,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2019-01-01 22:06:15,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 22:06:15,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 22:06:15,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-01-01 22:06:15,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:15,546 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-01-01 22:06:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-01-01 22:06:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-01 22:06:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 22:06:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-01 22:06:15,588 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-01 22:06:15,588 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-01 22:06:15,588 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:06:15,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-01-01 22:06:15,590 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:15,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:15,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:15,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:15,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:15,595 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 88#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 89#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 90#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 70#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 71#fENTRY [2019-01-01 22:06:15,595 INFO L796 eck$LassoCheckResult]: Loop: 71#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 87#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 76#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 78#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 92#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 75#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 78#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 92#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 83#gFINAL assume true; 84#gEXIT >#59#return; 81#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 82#gFINAL assume true; 94#gEXIT >#53#return; 73#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 71#fENTRY [2019-01-01 22:06:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 2 times [2019-01-01 22:06:15,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:15,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:15,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:15,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:15,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1707443993, now seen corresponding path program 1 times [2019-01-01 22:06:15,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:15,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:06:16,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:16,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:16,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:16,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:16,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 22:06:16,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:06:16,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:16,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:16,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:16,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-01-01 22:06:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:06:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-01-01 22:06:16,505 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:06:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:06:16,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-01-01 22:06:16,507 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 10 Second operand 13 states. [2019-01-01 22:06:16,896 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:06:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:17,294 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-01-01 22:06:17,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:06:17,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-01 22:06:17,298 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:17,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2019-01-01 22:06:17,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-01-01 22:06:17,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 22:06:17,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2019-01-01 22:06:17,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:17,302 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-01-01 22:06:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2019-01-01 22:06:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-01 22:06:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:06:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-01 22:06:17,307 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:06:17,307 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-01 22:06:17,308 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:06:17,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-01-01 22:06:17,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:06:17,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:17,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:17,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:06:17,310 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:17,311 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 205#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 206#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 186#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 187#fENTRY [2019-01-01 22:06:17,311 INFO L796 eck$LassoCheckResult]: Loop: 187#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 203#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 189#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 188#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 188#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 210#gFINAL assume true; 213#gEXIT >#59#return; 195#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 196#gFINAL assume true; 199#gEXIT >#59#return; 201#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 212#gFINAL assume true; 211#gEXIT >#53#return; 192#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 187#fENTRY [2019-01-01 22:06:17,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 3 times [2019-01-01 22:06:17,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 705855503, now seen corresponding path program 2 times [2019-01-01 22:06:17,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:17,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:17,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1432639553, now seen corresponding path program 1 times [2019-01-01 22:06:17,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:17,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:17,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:17,660 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 22:06:17,811 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:06:18,302 WARN L181 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-01-01 22:06:18,509 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 22:06:19,112 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-01-01 22:06:19,228 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:06:19,494 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 22:06:19,604 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-01 22:06:20,083 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 126 [2019-01-01 22:06:20,242 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 22:06:20,397 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 22:06:20,648 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-01 22:06:20,915 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-01-01 22:06:21,192 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 22:06:21,309 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-01 22:06:21,320 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:21,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:21,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:21,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:21,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:21,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:21,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:21,322 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:21,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:06:21,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:21,323 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:21,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:06:21,349 INFO 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:06:21,351 INFO 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:06:21,354 INFO 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:06:21,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,357 INFO 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:06:21,360 INFO 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:06:21,362 INFO 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:06:21,364 INFO 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:06:21,367 INFO 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:06:21,370 INFO 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:06:21,373 INFO 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:06:21,376 INFO 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:06:21,379 INFO 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:06:21,381 INFO 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:06:21,383 INFO 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:06:21,386 INFO 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:06:21,387 INFO 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:06:21,389 INFO 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:06:21,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:06:21,392 INFO 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:06:21,412 INFO 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:06:21,426 INFO 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:06:21,428 INFO 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:06:21,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,691 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-01 22:06:21,692 INFO 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:06:21,695 INFO 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:06:21,696 INFO 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:06:21,697 INFO 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:06:21,698 INFO 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:06:21,700 INFO 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:06:21,708 INFO 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:06:21,709 INFO 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:06:21,710 INFO 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:06:21,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,723 INFO 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:06:21,724 INFO 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:06:21,730 INFO 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:06:21,731 INFO 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:06:21,733 INFO 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:06:21,734 INFO 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:06:21,736 INFO 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:06:21,738 INFO 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:06:21,739 INFO 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:06:21,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:21,742 INFO 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:06:21,744 INFO 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:06:21,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:22,092 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 22:06:22,875 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:06:22,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:22,954 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:22,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,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:06:22,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,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:06:22,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:22,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:22,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:22,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:22,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:22,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:22,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:22,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:22,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:22,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:23,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:23,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,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:06:23,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:23,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:23,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:23,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,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:06:23,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:23,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:23,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:23,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:23,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:23,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:23,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:23,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:23,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:23,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:23,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:23,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:23,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:23,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:23,163 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:06:23,168 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:23,169 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:23,170 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:23,172 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2019-01-01 22:06:23,202 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:06:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:23,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:23,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 22:06:23,421 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 22:06:23,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 22:06:23,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 90 states and 107 transitions. Complement of second has 16 states. [2019-01-01 22:06:23,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:06:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 22:06:23,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 20 letters. [2019-01-01 22:06:23,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 20 letters. [2019-01-01 22:06:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 40 letters. [2019-01-01 22:06:23,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:23,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 107 transitions. [2019-01-01 22:06:23,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 22:06:23,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 61 states and 76 transitions. [2019-01-01 22:06:23,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 22:06:23,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-01-01 22:06:23,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2019-01-01 22:06:23,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:23,684 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-01-01 22:06:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2019-01-01 22:06:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2019-01-01 22:06:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-01 22:06:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-01-01 22:06:23,697 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-01-01 22:06:23,698 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-01-01 22:06:23,698 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:06:23,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. [2019-01-01 22:06:23,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 22:06:23,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:23,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:23,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:23,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:23,702 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 450#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 451#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 421#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 422#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 446#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 428#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 427#gENTRY [2019-01-01 22:06:23,702 INFO L796 eck$LassoCheckResult]: Loop: 427#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 453#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 426#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 427#gENTRY [2019-01-01 22:06:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2058005149, now seen corresponding path program 1 times [2019-01-01 22:06:23,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 1 times [2019-01-01 22:06:23,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:23,744 INFO L82 PathProgramCache]: Analyzing trace with hash -626731559, now seen corresponding path program 1 times [2019-01-01 22:06:23,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:23,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:23,905 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:06:24,526 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-01-01 22:06:25,082 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2019-01-01 22:06:25,176 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:25,177 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:25,177 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:25,177 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:25,177 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:25,177 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:25,177 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:25,177 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:25,177 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration4_Lasso [2019-01-01 22:06:25,177 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:25,178 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:25,182 INFO 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:06:25,202 INFO 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:06:25,204 INFO 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:06:25,387 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-01 22:06:25,423 INFO 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:06:25,425 INFO 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:06:25,426 INFO 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:06:25,428 INFO 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:06:25,430 INFO 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:06:25,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,437 INFO 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:06:25,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,441 INFO 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:06:25,443 INFO 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:06:25,445 INFO 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:06:25,451 INFO 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:06:25,453 INFO 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:06:25,455 INFO 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:06:25,456 INFO 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:06:25,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,460 INFO 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:06:25,462 INFO 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:06:25,465 INFO 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:06:25,467 INFO 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:06:25,469 INFO 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:06:25,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,474 INFO 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:06:25,476 INFO 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:06:25,478 INFO 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:06:25,480 INFO 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:06:25,482 INFO 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:06:25,484 INFO 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:06:25,487 INFO 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:06:25,489 INFO 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:06:25,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,493 INFO 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:06:25,495 INFO 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:06:25,499 INFO 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:06:25,501 INFO 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:06:25,503 INFO 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:06:25,524 INFO 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:06:25,537 INFO 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:06:25,539 INFO 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:06:25,567 INFO 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:06:25,580 INFO 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:06: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:06:25,583 INFO 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:06:25,586 INFO 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:06: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:06:25,593 INFO 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:06:25,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,598 INFO 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:06:25,600 INFO 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:06:25,602 INFO 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:06:25,604 INFO 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:06:25,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,609 INFO 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:06:25,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:25,616 INFO 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:06:25,617 INFO 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:06:25,621 INFO 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:06:25,622 INFO 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:06:25,624 INFO 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:06:25,626 INFO 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:06:25,629 INFO 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:06:25,808 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:06:25,917 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:06:26,287 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-01 22:06:26,434 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:26,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:26,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:26,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:26,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:26,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:26,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:26,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:26,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:26,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:26,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:26,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:06:26,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:26,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:26,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:26,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:26,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:26,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:26,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:26,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:26,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:26,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:26,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:26,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:26,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:26,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:26,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:26,471 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:26,479 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:06:26,479 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:06:26,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:26,481 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:26,482 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:26,482 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2019-01-01 22:06:26,505 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:06:26,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:26,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:26,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:26,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:26,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:06:26,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:26,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:06:26,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:26,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:26,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:26,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:06:26,821 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:06:26,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:06:26,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 22:06:26,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 71 states and 84 transitions. Complement of second has 15 states. [2019-01-01 22:06:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:06:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:06:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 22:06:26,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 22:06:26,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 22:06:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:26,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 22:06:26,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:26,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 84 transitions. [2019-01-01 22:06:26,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 22:06:26,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 54 states and 66 transitions. [2019-01-01 22:06:26,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-01-01 22:06:26,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-01-01 22:06:26,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2019-01-01 22:06:26,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:26,950 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-01-01 22:06:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2019-01-01 22:06:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-01 22:06:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-01 22:06:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-01-01 22:06:26,957 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-01-01 22:06:26,958 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-01-01 22:06:26,958 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:06:26,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 66 transitions. [2019-01-01 22:06:26,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 22:06:26,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:26,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:26,960 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:26,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:26,961 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 639#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 640#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 641#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 609#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 610#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 637#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 638#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 644#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 645#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 626#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 659#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 658#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 627#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 659#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 655#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 632#gFINAL assume true; 633#gEXIT >#59#return; 625#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 628#gFINAL assume true; 654#gEXIT >#59#return; 653#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 652#gFINAL assume true; 649#gEXIT >#53#return; 618#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 646#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 636#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 612#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 613#gENTRY [2019-01-01 22:06:26,961 INFO L796 eck$LassoCheckResult]: Loop: 613#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 643#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 611#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 613#gENTRY [2019-01-01 22:06:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 674903247, now seen corresponding path program 2 times [2019-01-01 22:06:26,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:26,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 22:06:27,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:27,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:27,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:06:27,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:06:27,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:06:27,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:27,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 22:06:27,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:06:27,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-01-01 22:06:27,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 22:06:27,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2019-01-01 22:06:27,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:27,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2019-01-01 22:06:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 22:06:27,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:27,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-01-01 22:06:27,678 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 2 times [2019-01-01 22:06:27,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:27,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:27,961 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:06:28,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 22:06:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-01-01 22:06:28,042 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. cyclomatic complexity: 18 Second operand 17 states. [2019-01-01 22:06:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:28,474 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2019-01-01 22:06:28,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 22:06:28,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 114 transitions. [2019-01-01 22:06:28,481 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2019-01-01 22:06:28,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 113 transitions. [2019-01-01 22:06:28,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-01 22:06:28,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2019-01-01 22:06:28,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2019-01-01 22:06:28,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:28,485 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2019-01-01 22:06:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2019-01-01 22:06:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2019-01-01 22:06:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-01 22:06:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-01-01 22:06:28,498 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-01-01 22:06:28,498 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-01-01 22:06:28,498 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:06:28,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2019-01-01 22:06:28,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-01-01 22:06:28,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:28,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:28,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:28,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:28,503 INFO L794 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 898#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 899#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 900#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 864#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 865#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 921#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 911#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 927#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 926#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 870#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 909#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 869#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 909#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 869#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 922#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 887#gFINAL assume true; 888#gEXIT >#59#return; 891#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 919#gFINAL assume true; 918#gEXIT >#59#return; 880#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 883#gFINAL assume true; 917#gEXIT >#59#return; 915#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 913#gFINAL assume true; 912#gEXIT >#53#return; 873#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 906#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 907#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 867#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 868#gENTRY [2019-01-01 22:06:28,503 INFO L796 eck$LassoCheckResult]: Loop: 868#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 928#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 866#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 868#gENTRY [2019-01-01 22:06:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -812610185, now seen corresponding path program 3 times [2019-01-01 22:06:28,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:28,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:28,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 3 times [2019-01-01 22:06:28,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:28,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2034316097, now seen corresponding path program 4 times [2019-01-01 22:06:28,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:28,832 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:06:29,561 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-01-01 22:06:30,182 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-01-01 22:06:30,293 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-01 22:06:30,418 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 22:06:30,949 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 120 [2019-01-01 22:06:31,065 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 22:06:31,217 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 22:06:31,354 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-01-01 22:06:32,183 WARN L181 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-01-01 22:06:32,345 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 22:06:32,959 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2019-01-01 22:06:33,116 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-01 22:06:33,478 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2019-01-01 22:06:33,741 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-01 22:06:33,918 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-01 22:06:35,090 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 157 DAG size of output: 156 [2019-01-01 22:06:35,482 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-01 22:06:35,490 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:35,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:35,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:35,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:35,491 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:35,491 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:35,491 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:35,491 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:35,491 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration6_Lasso [2019-01-01 22:06:35,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:35,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:35,496 INFO 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:06:35,504 INFO 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:06:35,507 INFO 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:06:35,514 INFO 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:06:35,520 INFO 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:06:35,522 INFO 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:06:35,525 INFO 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:06:35,528 INFO 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:06:35,534 INFO 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:06:35,536 INFO 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:06:35,542 INFO 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:06:35,544 INFO 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:06:35,562 INFO 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:06:35,572 INFO 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:06:35,574 INFO 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:06:35,575 INFO 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:06:35,578 INFO 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:06:35,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:06:35,583 INFO 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:06:35,586 INFO 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:06:35,614 INFO 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:06:35,629 INFO 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:06:35,631 INFO 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:06:35,633 INFO 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:06:35,637 INFO 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:06:35,640 INFO 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:06:35,642 INFO 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:06:35,646 INFO 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:06:35,648 INFO 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:06:35,651 INFO 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:06:35,654 INFO 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:06:35,656 INFO 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:06:35,659 INFO 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:06:35,665 INFO 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:06:35,667 INFO 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:06:35,679 INFO 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:06:35,681 INFO 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:06:35,682 INFO 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:06:35,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:06:35,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:06:35,692 INFO 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:06:35,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:06:35,696 INFO 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:06:35,701 INFO 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:06:35,703 INFO 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:06:35,707 INFO 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:06:35,709 INFO 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:06:35,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,715 INFO 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:06:35,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:35,722 INFO 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:06:35,724 INFO 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:06:35,727 INFO 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:06:35,729 INFO 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:06:35,731 INFO 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:06:35,734 INFO 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:06:35,736 INFO 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:06:35,739 INFO 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:06:35,741 INFO 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:06:35,744 INFO 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:06:36,104 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-01 22:06:36,143 INFO 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:06:36,146 INFO 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:06:36,148 INFO 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:06:36,150 INFO 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:06:36,152 INFO 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:06:36,154 INFO 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:06:36,156 INFO 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:06:36,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-01 22:07:05,837 WARN L181 SmtUtils]: Spent 29.30 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-01-01 22:07:05,978 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:05,978 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:07:05,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:05,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:05,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:05,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:05,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:05,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:05,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:05,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:05,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:05,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:05,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:05,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:05,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:05,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:05,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:05,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:05,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:05,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:05,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:07:05,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:05,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:05,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:05,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:05,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:05,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:05,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:05,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:05,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:05,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:05,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:05,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:05,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:05,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:05,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:05,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:05,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:05,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:05,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:05,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:06,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:06,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:06,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,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:07:06,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,170 INFO L205 nArgumentSynthesizer]: 256 stem disjuncts [2019-01-01 22:07:06,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,271 INFO L402 nArgumentSynthesizer]: We have 516 Motzkin's Theorem applications. [2019-01-01 22:07:06,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:06,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:06,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:06,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:06,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:06,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:06,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:06,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:06,863 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:07:06,871 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:07:06,871 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 22:07:06,871 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:07:06,872 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:07:06,873 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:07:06,873 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2019-01-01 22:07:06,913 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:07:06,929 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:07:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:07,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:07,587 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 22:07:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:07,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:07,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:07,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:07:07,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:07,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:07:07,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:07,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:07,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:07,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:07:07,790 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:07:07,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:07:07,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 22:07:07,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 72 states and 88 transitions. Complement of second has 15 states. [2019-01-01 22:07:07,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:07:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:07:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 22:07:07,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-01-01 22:07:07,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:07,906 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:07:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:07,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:08,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:08,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:08,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:07:08,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:08,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:07:08,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:07:08,179 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:07:08,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:07:08,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 22:07:08,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 72 states and 88 transitions. Complement of second has 15 states. [2019-01-01 22:07:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:07:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:07:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-01-01 22:07:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2019-01-01 22:07:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:08,414 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:07:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:08,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:08,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:08,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:08,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:07:08,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:08,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:07:08,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:08,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:07:08,907 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:07:08,907 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:07:08,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2019-01-01 22:07:09,030 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 95 states and 114 transitions. Complement of second has 15 states. [2019-01-01 22:07:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:07:09,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:07:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2019-01-01 22:07:09,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 34 letters. Loop has 3 letters. [2019-01-01 22:07:09,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:09,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 37 letters. Loop has 3 letters. [2019-01-01 22:07:09,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:09,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 34 letters. Loop has 6 letters. [2019-01-01 22:07:09,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:09,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 114 transitions. [2019-01-01 22:07:09,040 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:09,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 69 states and 87 transitions. [2019-01-01 22:07:09,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 22:07:09,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 22:07:09,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2019-01-01 22:07:09,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:07:09,043 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 87 transitions. [2019-01-01 22:07:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2019-01-01 22:07:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-01-01 22:07:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 22:07:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2019-01-01 22:07:09,049 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-01-01 22:07:09,049 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-01-01 22:07:09,049 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:07:09,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 73 transitions. [2019-01-01 22:07:09,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:09,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:09,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:09,052 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:09,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:07:09,052 INFO L794 eck$LassoCheckResult]: Stem: 1626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1623#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 1624#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 1625#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 1592#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 1593#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1630#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1608#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1628#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1629#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 1601#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1602#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1650#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 1600#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1602#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1651#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1614#gFINAL assume true; 1615#gEXIT >#59#return; 1611#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1612#gFINAL assume true; 1649#gEXIT >#59#return; 1607#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1610#gFINAL assume true; 1613#gEXIT >#53#return; 1618#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1634#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1647#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 1644#fFINAL assume true; 1640#fEXIT >#55#return; 1619#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 1599#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 1597#gENTRY [2019-01-01 22:07:09,052 INFO L796 eck$LassoCheckResult]: Loop: 1597#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1627#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 1598#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1597#gENTRY [2019-01-01 22:07:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:09,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1299014260, now seen corresponding path program 1 times [2019-01-01 22:07:09,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:09,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 4 times [2019-01-01 22:07:09,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:09,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:09,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1278507682, now seen corresponding path program 2 times [2019-01-01 22:07:09,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:09,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:09,321 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:07:09,922 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2019-01-01 22:07:10,092 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 22:07:10,502 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 22:07:10,851 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 111 [2019-01-01 22:07:11,080 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 22:07:11,219 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-01 22:07:13,454 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 222 DAG size of output: 205 [2019-01-01 22:07:13,878 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-01-01 22:07:14,251 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-01-01 22:07:14,558 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:07:14,901 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-01-01 22:07:15,013 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 22:07:15,269 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-01-01 22:07:15,520 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:07:18,003 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 171 DAG size of output: 170 [2019-01-01 22:07:18,701 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-01 22:07:18,705 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:18,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:18,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:18,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:18,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:07:18,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:18,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:18,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:18,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration7_Lasso [2019-01-01 22:07:18,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:18,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:18,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,718 INFO 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:07:18,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,721 INFO 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:07:18,723 INFO 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:07:18,724 INFO 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:07:18,726 INFO 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:07:18,727 INFO 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:07:18,728 INFO 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:07:18,749 INFO 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:07:18,752 INFO 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:07:18,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,757 INFO 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:07:18,761 INFO 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:07:18,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,764 INFO 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:07:18,766 INFO 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:07:18,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,781 INFO 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:07:18,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,787 INFO 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:07:18,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,793 INFO 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:07:18,795 INFO 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:07:18,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,797 INFO 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:07:18,799 INFO 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:07:18,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,801 INFO 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:07:18,803 INFO 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:07:18,804 INFO 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:07:18,806 INFO 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:07:18,810 INFO 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:07:18,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,816 INFO 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:07:18,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,825 INFO 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:07:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,828 INFO 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:07:18,830 INFO 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:07:18,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,832 INFO 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:07:18,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,835 INFO 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:07:18,837 INFO 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:07:18,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,841 INFO 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:07:18,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,844 INFO 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:07:18,862 INFO 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:07:18,876 INFO 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:07:18,878 INFO 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:07:18,882 INFO 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:07:18,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:18,886 INFO 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:07:18,887 INFO 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:07:19,299 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-01-01 22:07:19,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:07:19,336 INFO 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:07:19,338 INFO 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:07:19,340 INFO 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:07:19,717 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-01 22:07:49,295 WARN L181 SmtUtils]: Spent 29.49 s on a formula simplification. DAG size of input: 307 DAG size of output: 307 [2019-01-01 22:07:49,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:49,407 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:07:49,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,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:07:49,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,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:07:49,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:49,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:49,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,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:07:49,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:49,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:49,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:49,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:49,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:49,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:49,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:49,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:49,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:49,635 INFO L205 nArgumentSynthesizer]: 256 stem disjuncts [2019-01-01 22:07:49,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:49,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:49,762 INFO L402 nArgumentSynthesizer]: We have 516 Motzkin's Theorem applications. [2019-01-01 22:07:49,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:50,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:50,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:50,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,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:07:50,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:50,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:50,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:50,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:50,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:50,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:50,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:50,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:50,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:50,442 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:07:50,447 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:07:50,448 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:07:50,448 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:07:50,449 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:07:50,449 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:07:50,449 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_3) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_3 + 1 Supporting invariants [] [2019-01-01 22:07:50,491 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:07:50,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:07:50,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:50,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:51,125 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 22:07:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:51,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:51,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:51,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2019-01-01 22:07:51,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:51,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2019-01-01 22:07:51,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:51,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:51,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:51,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-01-01 22:07:51,381 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:07:51,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:07:51,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 73 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-01 22:07:51,529 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 73 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 84 states and 106 transitions. Complement of second has 18 states. [2019-01-01 22:07:51,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:07:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:07:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-01-01 22:07:51,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 31 letters. Loop has 3 letters. [2019-01-01 22:07:51,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:51,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 34 letters. Loop has 3 letters. [2019-01-01 22:07:51,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:51,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 31 letters. Loop has 6 letters. [2019-01-01 22:07:51,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:51,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 106 transitions. [2019-01-01 22:07:51,535 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:51,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 78 states and 100 transitions. [2019-01-01 22:07:51,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-01 22:07:51,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-01-01 22:07:51,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 100 transitions. [2019-01-01 22:07:51,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:07:51,539 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-01-01 22:07:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 100 transitions. [2019-01-01 22:07:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-01-01 22:07:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-01 22:07:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2019-01-01 22:07:51,547 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 96 transitions. [2019-01-01 22:07:51,547 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 96 transitions. [2019-01-01 22:07:51,548 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:07:51,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 96 transitions. [2019-01-01 22:07:51,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:51,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:51,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:51,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:51,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:51,555 INFO L794 eck$LassoCheckResult]: Stem: 1922#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1919#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 1920#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 1921#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 1884#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 1885#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1918#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1901#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1932#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1956#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 1893#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1894#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1926#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 1892#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1894#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1927#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1908#gFINAL assume true; 1909#gEXIT >#59#return; 1914#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1957#gFINAL assume true; 1955#gEXIT >#59#return; 1899#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1902#gFINAL assume true; 1907#gEXIT >#53#return; 1912#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1928#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1929#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 1959#fFINAL assume true; 1958#fEXIT >#55#return; 1915#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 1886#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 1887#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1925#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1947#gFINAL assume true; 1942#gEXIT >#57#return; 1941#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 1934#L36-3 [2019-01-01 22:07:51,555 INFO L796 eck$LassoCheckResult]: Loop: 1934#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 1933#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 1934#L36-3 [2019-01-01 22:07:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 285182745, now seen corresponding path program 1 times [2019-01-01 22:07:51,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:51,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 22:07:51,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:51,829 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 1 times [2019-01-01 22:07:51,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:07:51,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:07:51,879 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-01-01 22:07:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:51,987 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2019-01-01 22:07:51,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:07:51,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 96 transitions. [2019-01-01 22:07:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:51,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 93 transitions. [2019-01-01 22:07:51,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-01 22:07:51,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-01 22:07:51,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2019-01-01 22:07:51,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:07:51,995 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-01-01 22:07:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2019-01-01 22:07:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-01 22:07:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 22:07:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2019-01-01 22:07:52,002 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-01-01 22:07:52,002 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-01-01 22:07:52,002 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:07:52,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 93 transitions. [2019-01-01 22:07:52,003 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:52,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:52,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:52,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:52,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:52,005 INFO L794 eck$LassoCheckResult]: Stem: 2087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2084#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2085#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2086#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2050#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2051#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2083#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2067#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2096#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2118#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2057#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2058#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2090#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2056#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2058#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2091#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2074#gFINAL assume true; 2075#gEXIT >#59#return; 2069#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2070#gFINAL assume true; 2120#gEXIT >#59#return; 2065#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2068#gFINAL assume true; 2073#gEXIT >#53#return; 2078#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2092#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2093#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2124#fFINAL assume true; 2123#fEXIT >#55#return; 2081#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2059#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2060#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2089#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2099#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2105#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2098#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2100#gFINAL assume true; 2122#gEXIT >#59#return; 2108#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2109#gFINAL assume true; 2107#gEXIT >#57#return; 2071#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2072#L36-3 [2019-01-01 22:07:52,005 INFO L796 eck$LassoCheckResult]: Loop: 2072#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2097#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2072#L36-3 [2019-01-01 22:07:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1887283889, now seen corresponding path program 2 times [2019-01-01 22:07:52,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:52,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:52,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:52,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:52,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:52,892 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 22:07:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 22:07:52,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:52,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:07:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:07:53,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:07:53,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:07:53,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:53,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 22:07:53,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:07:53,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:53,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2019-01-01 22:07:53,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-01 22:07:53,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:53,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:53,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 33 [2019-01-01 22:07:53,243 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 22:07:53,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:07:53,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:07:53,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 22:07:53,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:30 [2019-01-01 22:07:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 22:07:53,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:07:53,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-01-01 22:07:53,482 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 2 times [2019-01-01 22:07:53,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-01 22:07:53,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-01-01 22:07:53,522 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. cyclomatic complexity: 24 Second operand 14 states. [2019-01-01 22:07:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:53,822 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2019-01-01 22:07:53,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:07:53,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 97 transitions. [2019-01-01 22:07:53,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:53,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 97 transitions. [2019-01-01 22:07:53,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-01 22:07:53,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2019-01-01 22:07:53,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2019-01-01 22:07:53,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:07:53,830 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-01-01 22:07:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2019-01-01 22:07:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-01 22:07:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 22:07:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2019-01-01 22:07:53,836 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-01-01 22:07:53,836 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-01-01 22:07:53,836 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:07:53,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 97 transitions. [2019-01-01 22:07:53,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:53,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:53,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:53,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:53,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:53,839 INFO L794 eck$LassoCheckResult]: Stem: 2389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2386#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2387#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2388#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2351#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2352#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2384#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2385#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2396#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2421#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2362#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2363#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2391#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2361#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2363#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2392#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2425#gFINAL assume true; 2424#gEXIT >#59#return; 2423#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2422#gFINAL assume true; 2420#gEXIT >#59#return; 2418#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2416#gFINAL assume true; 2415#gEXIT >#53#return; 2414#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2400#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2419#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2417#fFINAL assume true; 2413#fEXIT >#55#return; 2380#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2367#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2356#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2390#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2368#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2406#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2390#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2368#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2406#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2401#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2374#gFINAL assume true; 2375#gEXIT >#59#return; 2366#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2369#gFINAL assume true; 2412#gEXIT >#59#return; 2409#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2410#gFINAL assume true; 2408#gEXIT >#57#return; 2407#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2398#L36-3 [2019-01-01 22:07:53,839 INFO L796 eck$LassoCheckResult]: Loop: 2398#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2397#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2398#L36-3 [2019-01-01 22:07:53,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2114677145, now seen corresponding path program 3 times [2019-01-01 22:07:53,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 22:07:54,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:54,161 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:07:54,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:07:54,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 22:07:54,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:07:54,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:54,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 22:07:54,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-01-01 22:07:54,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:54,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:54,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:54,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-01-01 22:07:54,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 22:07:54,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:07:54,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:54,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2019-01-01 22:07:54,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-01 22:07:54,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:54,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:07:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 33 [2019-01-01 22:07:54,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 22:07:54,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:07:54,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:07:54,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 22:07:54,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:30 [2019-01-01 22:07:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 22:07:54,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:07:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2019-01-01 22:07:54,948 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 3 times [2019-01-01 22:07:54,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:54,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:54,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:54,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:55,109 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:07:55,232 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 22:07:55,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-01 22:07:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-01-01 22:07:55,233 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. cyclomatic complexity: 25 Second operand 19 states. [2019-01-01 22:07:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:55,734 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-01-01 22:07:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-01 22:07:55,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2019-01-01 22:07:55,739 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:55,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 105 transitions. [2019-01-01 22:07:55,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-01 22:07:55,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 22:07:55,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 105 transitions. [2019-01-01 22:07:55,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:07:55,744 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 105 transitions. [2019-01-01 22:07:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 105 transitions. [2019-01-01 22:07:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-01 22:07:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-01 22:07:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2019-01-01 22:07:55,757 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 101 transitions. [2019-01-01 22:07:55,757 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 101 transitions. [2019-01-01 22:07:55,757 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:07:55,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 101 transitions. [2019-01-01 22:07:55,763 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2019-01-01 22:07:55,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:55,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:55,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:55,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:55,767 INFO L794 eck$LassoCheckResult]: Stem: 2736#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2733#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.allocOnHeap(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2734#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2735#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~short20;havoc main_#t~mem19;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2694#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2695#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2761#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2760#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2743#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2768#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2705#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2706#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2738#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2704#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2706#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2739#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2748#gFINAL assume true; 2725#gEXIT >#59#return; 2726#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2769#gFINAL assume true; 2767#gEXIT >#59#return; 2765#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2763#gFINAL assume true; 2762#gEXIT >#53#return; 2721#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2740#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2730#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2720#fFINAL assume true; 2723#fEXIT >#55#return; 2757#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;havoc #t~ret4.base, #t~ret4.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2711#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2699#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2737#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2710#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2756#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2737#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2710#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2756#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2737#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~post11;havoc #t~mem10; 2710#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2756#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2746#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2747#gFINAL assume true; 2724#gEXIT >#59#return; 2709#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2712#gFINAL assume true; 2774#gEXIT >#59#return; 2773#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2772#gFINAL assume true; 2771#gEXIT >#59#return; 2754#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2755#gFINAL assume true; 2753#gEXIT >#57#return; 2752#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2745#L36-3 [2019-01-01 22:07:55,767 INFO L796 eck$LassoCheckResult]: Loop: 2745#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2744#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2745#L36-3 [2019-01-01 22:07:55,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1644390193, now seen corresponding path program 4 times [2019-01-01 22:07:55,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:55,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 4 times [2019-01-01 22:07:55,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:55,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:55,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash -288989002, now seen corresponding path program 1 times [2019-01-01 22:07:55,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:55,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:00,146 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-01 22:08:00,578 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 22:08:00,972 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 22:08:01,705 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-01-01 22:08:02,124 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-01-01 22:08:02,761 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-01-01 22:08:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-01 22:08:03,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:03,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:08:03,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:03,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:03,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:08:03,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:08:03,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-01 22:08:03,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-01-01 22:08:03,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:08:03,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 22:08:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 22:08:03,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:08:03,314 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2019-01-01 22:08:40,145 WARN L181 SmtUtils]: Spent 12.11 s on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:08:52,295 WARN L181 SmtUtils]: Spent 12.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:10:05,526 WARN L181 SmtUtils]: Spent 12.09 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:10:16,978 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-01-01 22:10:16,980 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:929) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-01 22:10:16,987 INFO L168 Benchmark]: Toolchain (without parser) took 243909.31 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 926.9 MB). Free memory was 951.4 MB in the beginning and 1.4 GB in the end (delta: -495.7 MB). Peak memory consumption was 431.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:16,988 INFO L168 Benchmark]: CDTParser took 0.16 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:10:16,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:16,991 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:16,992 INFO L168 Benchmark]: Boogie Preprocessor took 34.50 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:16,992 INFO L168 Benchmark]: RCFGBuilder took 775.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:16,993 INFO L168 Benchmark]: BuchiAutomizer took 242705.94 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 808.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -361.3 MB). Peak memory consumption was 447.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:17,005 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.16 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 339.20 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.39 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.50 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 775.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 242705.94 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 808.5 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -361.3 MB). Peak memory consumption was 447.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...