./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer --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 f7c8cd0f6441598a9b17eacee015376606f871a4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:19,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:19,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:19,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:19,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:19,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:19,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:19,949 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:19,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:19,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:19,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:19,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:19,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:19,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:19,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:19,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:19,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:19,957 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:19,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:19,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:19,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:19,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:19,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:19,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:19,964 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:19,965 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:19,966 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:19,967 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:19,967 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:19,968 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:19,968 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:19,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:19,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:19,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:19,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:19,971 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:19,971 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:19,983 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:19,983 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:19,984 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:19,984 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:19,984 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:19,985 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:19,985 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:19,985 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:19,985 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:19,985 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:19,985 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:19,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:19,986 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:19,987 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:19,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:19,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:19,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:19,987 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:19,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:19,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:19,988 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:19,988 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:19,988 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer 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 -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2018-10-27 06:10:20,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:20,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:20,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:20,039 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:20,039 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:20,040 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-10-27 06:10:20,083 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/data/cd22cc220/5a626a57d26a4c86b4db6f60c1bbf4f6/FLAG06d26baec [2018-10-27 06:10:20,417 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:20,417 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-10-27 06:10:20,421 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/data/cd22cc220/5a626a57d26a4c86b4db6f60c1bbf4f6/FLAG06d26baec [2018-10-27 06:10:20,434 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/data/cd22cc220/5a626a57d26a4c86b4db6f60c1bbf4f6 [2018-10-27 06:10:20,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:20,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:20,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:20,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:20,444 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:20,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5f82de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20, skipping insertion in model container [2018-10-27 06:10:20,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:20,469 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:20,576 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:20,583 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:20,595 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:20,608 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:20,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20 WrapperNode [2018-10-27 06:10:20,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:20,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:20,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:20,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:20,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:20,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:20,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:20,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:20,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... [2018-10-27 06:10:20,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:20,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:20,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:20,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:20,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/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 [2018-10-27 06:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-10-27 06:10:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-10-27 06:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-10-27 06:10:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-10-27 06:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:20,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:20,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:20,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:21,253 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:21,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:21 BoogieIcfgContainer [2018-10-27 06:10:21,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:21,254 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:21,254 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:21,259 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:21,259 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:21,260 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:20" (1/3) ... [2018-10-27 06:10:21,261 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c9add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:21, skipping insertion in model container [2018-10-27 06:10:21,261 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:21,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:20" (2/3) ... [2018-10-27 06:10:21,262 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c9add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:21, skipping insertion in model container [2018-10-27 06:10:21,262 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:21,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:21" (3/3) ... [2018-10-27 06:10:21,265 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5_true-termination.c.i [2018-10-27 06:10:21,312 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:21,313 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:21,313 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:21,313 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:21,313 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:21,314 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:21,314 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:21,314 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:21,314 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:21,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-10-27 06:10:21,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:21,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:21,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:21,361 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,362 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:21,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2018-10-27 06:10:21,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:21,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:21,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:21,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:21,374 INFO L793 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 5#L60true SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 3#L60-1true havoc main_#t~nondet13; 26#L61true SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 23#L61-1true havoc main_#t~nondet14; 10#L63true SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 28#L63-1true main_#t~short17 := main_#t~mem15 < 0; 27#L63-2true assume main_#t~short17; 39#L63-6true assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 37#L66true SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 35#L66-1true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 12#fENTRYtrue [2018-10-27 06:10:21,374 INFO L795 eck$LassoCheckResult]: Loop: 12#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 29#L17true assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 17#L23true SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 18#L23-1true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 33#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset; 19#L34true SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 21#L34-1true assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 25#gEXITtrue >#52#return; 13#L25true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 12#fENTRYtrue [2018-10-27 06:10:21,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,383 INFO L82 PathProgramCache]: Analyzing trace with hash 740786844, now seen corresponding path program 1 times [2018-10-27 06:10:21,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:21,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:21,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:21,541 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1997779939, now seen corresponding path program 1 times [2018-10-27 06:10:21,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:21,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:21,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:21,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:21,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 06:10:21,800 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:21,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:10:21,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:10:21,822 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 8 states. [2018-10-27 06:10:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:22,033 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-10-27 06:10:22,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:10:22,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2018-10-27 06:10:22,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:22,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 35 transitions. [2018-10-27 06:10:22,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:10:22,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:10:22,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 35 transitions. [2018-10-27 06:10:22,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:22,047 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-10-27 06:10:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 35 transitions. [2018-10-27 06:10:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-27 06:10:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:10:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-10-27 06:10:22,072 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-10-27 06:10:22,073 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-10-27 06:10:22,073 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:22,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 35 transitions. [2018-10-27 06:10:22,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:22,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:22,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:22,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:22,076 INFO L793 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 105#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 99#L60-1 havoc main_#t~nondet13; 100#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 123#L61-1 havoc main_#t~nondet14; 110#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 111#L63-1 main_#t~short17 := main_#t~mem15 < 0; 124#L63-2 assume main_#t~short17; 120#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 129#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 113#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 112#fENTRY [2018-10-27 06:10:22,076 INFO L795 eck$LassoCheckResult]: Loop: 112#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 115#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 116#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 102#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 106#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 117#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 118#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 121#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 125#L39-1 #t~post8 := #t~mem7; 127#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 128#L39-3 havoc #t~post8;havoc #t~mem7; 103#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 106#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 117#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 118#L34-1 assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 101#gFINAL assume true; 104#gEXIT >#56#return; 107#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 108#gFINAL assume true; 130#gEXIT >#52#return; 114#L25 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 112#fENTRY [2018-10-27 06:10:22,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 740786844, now seen corresponding path program 2 times [2018-10-27 06:10:22,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:22,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:22,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:10:22,131 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:22,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash -996418921, now seen corresponding path program 1 times [2018-10-27 06:10:22,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:22,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:22,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:10:22,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:22,796 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/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 [2018-10-27 06:10:22,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:22,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:22,971 INFO L477 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 [2018-10-27 06:10:22,977 INFO L477 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 [2018-10-27 06:10:22,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:22,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-10-27 06:10:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:10:23,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:23,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2018-10-27 06:10:23,495 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:10:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:10:23,496 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-10-27 06:10:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:23,507 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-10-27 06:10:23,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:10:23,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2018-10-27 06:10:23,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:23,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 32 states and 34 transitions. [2018-10-27 06:10:23,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:10:23,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:10:23,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2018-10-27 06:10:23,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:23,514 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-27 06:10:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2018-10-27 06:10:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-27 06:10:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:10:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-27 06:10:23,517 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-27 06:10:23,517 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-27 06:10:23,517 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:23,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2018-10-27 06:10:23,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:23,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:23,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:23,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:23,519 INFO L793 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 252#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 246#L60-1 havoc main_#t~nondet13; 247#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 270#L61-1 havoc main_#t~nondet14; 257#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 258#L63-1 main_#t~short17 := main_#t~mem15 < 0; 271#L63-2 assume !main_#t~short17; 269#L63-4 SUMMARY for call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L63-4 266#L63-5 main_#t~short17 := main_#t~mem16 < 0; 267#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 276#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 260#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 259#fENTRY [2018-10-27 06:10:23,520 INFO L795 eck$LassoCheckResult]: Loop: 259#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 262#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 263#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 250#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 253#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 264#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 265#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 268#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 272#L39-1 #t~post8 := #t~mem7; 274#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 275#L39-3 havoc #t~post8;havoc #t~mem7; 249#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 253#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 264#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 265#L34-1 assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 248#gFINAL assume true; 251#gEXIT >#56#return; 254#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 255#gFINAL assume true; 277#gEXIT >#52#return; 261#L25 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 259#fENTRY [2018-10-27 06:10:23,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1017839975, now seen corresponding path program 1 times [2018-10-27 06:10:23,520 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:23,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:23,598 INFO L82 PathProgramCache]: Analyzing trace with hash -996418921, now seen corresponding path program 2 times [2018-10-27 06:10:23,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:23,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:23,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:23,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:10:23,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:23,860 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/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 [2018-10-27 06:10:23,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:23,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:23,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:23,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:23,938 INFO L477 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 [2018-10-27 06:10:23,940 INFO L477 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 [2018-10-27 06:10:23,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:23,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-10-27 06:10:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 06:10:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:24,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2018-10-27 06:10:24,183 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:10:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 06:10:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=278, Unknown=5, NotChecked=0, Total=342 [2018-10-27 06:10:24,184 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 4 Second operand 19 states. [2018-10-27 06:10:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:24,600 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-10-27 06:10:24,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:10:24,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-10-27 06:10:24,602 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:24,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 37 transitions. [2018-10-27 06:10:24,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:10:24,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-10-27 06:10:24,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 37 transitions. [2018-10-27 06:10:24,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:24,604 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-27 06:10:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 37 transitions. [2018-10-27 06:10:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:10:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:10:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-10-27 06:10:24,607 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-27 06:10:24,607 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-10-27 06:10:24,607 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:24,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2018-10-27 06:10:24,608 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-10-27 06:10:24,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:24,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:24,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:24,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:24,613 INFO L793 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 415#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 411#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 405#L60-1 havoc main_#t~nondet13; 406#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 429#L61-1 havoc main_#t~nondet14; 416#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 417#L63-1 main_#t~short17 := main_#t~mem15 < 0; 430#L63-2 assume !main_#t~short17; 428#L63-4 SUMMARY for call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L63-4 425#L63-5 main_#t~short17 := main_#t~mem16 < 0; 426#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 435#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 419#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 420#fENTRY [2018-10-27 06:10:24,613 INFO L795 eck$LassoCheckResult]: Loop: 420#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 421#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 422#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 408#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 412#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 423#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 424#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 427#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 431#L39-1 #t~post8 := #t~mem7; 433#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 434#L39-3 havoc #t~post8;havoc #t~mem7; 409#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 412#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 423#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 424#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 427#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 431#L39-1 #t~post8 := #t~mem7; 433#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 434#L39-3 havoc #t~post8;havoc #t~mem7; 409#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 412#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 423#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 424#L34-1 assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 407#gFINAL assume true; 410#gEXIT >#56#return; 413#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 414#gFINAL assume true; 439#gEXIT >#56#return; 437#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 438#gFINAL assume true; 436#gEXIT >#52#return; 418#L25 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 420#fENTRY [2018-10-27 06:10:24,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1017839975, now seen corresponding path program 2 times [2018-10-27 06:10:24,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:24,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1232290037, now seen corresponding path program 3 times [2018-10-27 06:10:24,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:24,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -293511773, now seen corresponding path program 1 times [2018-10-27 06:10:24,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:25,051 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-10-27 06:10:25,178 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-27 06:10:25,678 WARN L179 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-10-27 06:10:26,260 WARN L179 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 144 [2018-10-27 06:10:26,529 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-10-27 06:10:26,909 WARN L179 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 151 [2018-10-27 06:10:27,014 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-27 06:10:27,344 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2018-10-27 06:10:27,586 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-27 06:10:27,647 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:27,648 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:27,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:27,649 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:27,649 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:27,649 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:27,649 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:27,649 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:27,649 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:10:27,649 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:27,649 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:27,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:27,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:28,349 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:28,353 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:28,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:28,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:28,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,463 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:28,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:28,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:28,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,485 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:10:28,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:28,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:28,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:28,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:28,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:28,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:28,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:28,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:28,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:28,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 [2018-10-27 06:10:28,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:28,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:28,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:28,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:28,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:28,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:28,528 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:28,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:28,532 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:28,537 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:28,545 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:28,546 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:28,546 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2018-10-27 06:10:28,570 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:10:28,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:28,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 06:10:28,830 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 [2018-10-27 06:10:28,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-10-27 06:10:28,948 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 37 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 96 states and 104 transitions. Complement of second has 15 states. [2018-10-27 06:10:28,949 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 [2018-10-27 06:10:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:10:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-10-27 06:10:28,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 32 letters. [2018-10-27 06:10:28,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:28,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 46 letters. Loop has 32 letters. [2018-10-27 06:10:28,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:28,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 14 letters. Loop has 64 letters. [2018-10-27 06:10:28,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:28,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 104 transitions. [2018-10-27 06:10:28,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:28,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 73 states and 79 transitions. [2018-10-27 06:10:28,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:10:28,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:10:28,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 79 transitions. [2018-10-27 06:10:28,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:28,963 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-10-27 06:10:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 79 transitions. [2018-10-27 06:10:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2018-10-27 06:10:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 06:10:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-10-27 06:10:28,969 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:10:28,969 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:10:28,969 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:28,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2018-10-27 06:10:28,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:28,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:28,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:28,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:28,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:28,972 INFO L793 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 721#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 715#L60-1 havoc main_#t~nondet13; 716#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 750#L61-1 havoc main_#t~nondet14; 728#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 729#L63-1 main_#t~short17 := main_#t~mem15 < 0; 752#L63-2 assume !main_#t~short17; 749#L63-4 SUMMARY for call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L63-4 744#L63-5 main_#t~short17 := main_#t~mem16 < 0; 745#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 764#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 732#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 733#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 735#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 736#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 724#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 723#gENTRY [2018-10-27 06:10:28,973 INFO L795 eck$LassoCheckResult]: Loop: 723#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 740#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 741#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 746#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 753#L39-1 #t~post8 := #t~mem7; 757#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 761#L39-3 havoc #t~post8;havoc #t~mem7; 722#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 723#gENTRY [2018-10-27 06:10:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -49145365, now seen corresponding path program 1 times [2018-10-27 06:10:28,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:28,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 58123592, now seen corresponding path program 1 times [2018-10-27 06:10:28,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:28,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:28,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:29,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 65893682, now seen corresponding path program 1 times [2018-10-27 06:10:29,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:29,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:29,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:29,202 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:10:29,634 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2018-10-27 06:10:29,917 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2018-10-27 06:10:29,962 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:29,962 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:29,962 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:29,962 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:29,962 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:29,962 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:29,963 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:29,963 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:29,963 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration5_Lasso [2018-10-27 06:10:29,963 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:29,963 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:29,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:30,499 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:30,499 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:30,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:30,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:30,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,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 [2018-10-27 06:10:30,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:30,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:30,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:30,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:30,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:30,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:30,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:30,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:30,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:30,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:30,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:30,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:30,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:30,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:30,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:30,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:30,762 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:30,765 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:30,765 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:30,765 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:30,766 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:30,766 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:30,767 INFO L519 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 [] [2018-10-27 06:10:30,857 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:10:30,884 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:31,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:31,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:31,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:31,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:31,293 INFO L477 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 39 treesize of output 38 [2018-10-27 06:10:31,295 INFO L477 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 38 treesize of output 29 [2018-10-27 06:10:31,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:31,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:31,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:31,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:31,331 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-10-27 06:10:31,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 59 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-10-27 06:10:31,577 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 59 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 131 states and 140 transitions. Complement of second has 31 states. [2018-10-27 06:10:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-27 06:10:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-10-27 06:10:31,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 18 letters. Loop has 8 letters. [2018-10-27 06:10:31,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:31,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 26 letters. Loop has 8 letters. [2018-10-27 06:10:31,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:31,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 31 transitions. Stem has 18 letters. Loop has 16 letters. [2018-10-27 06:10:31,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:31,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 140 transitions. [2018-10-27 06:10:31,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:31,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 81 states and 89 transitions. [2018-10-27 06:10:31,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:10:31,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:10:31,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 89 transitions. [2018-10-27 06:10:31,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:31,586 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-10-27 06:10:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 89 transitions. [2018-10-27 06:10:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-27 06:10:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 06:10:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-10-27 06:10:31,596 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-10-27 06:10:31,596 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-10-27 06:10:31,596 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:31,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 89 transitions. [2018-10-27 06:10:31,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:31,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:31,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:31,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:31,598 INFO L793 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1061#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 1055#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 1047#L60-1 havoc main_#t~nondet13; 1048#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 1084#L61-1 havoc main_#t~nondet14; 1062#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 1063#L63-1 main_#t~short17 := main_#t~mem15 < 0; 1086#L63-2 assume !main_#t~short17; 1083#L63-4 SUMMARY for call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L63-4 1079#L63-5 main_#t~short17 := main_#t~mem16 < 0; 1080#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 1095#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 1065#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 1067#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1068#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 1124#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 1098#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1123#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1122#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1121#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1119#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1117#L39-1 #t~post8 := #t~mem7; 1116#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1115#L39-3 havoc #t~post8;havoc #t~mem7; 1052#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1114#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1112#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1109#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1110#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1127#L39-1 #t~post8 := #t~mem7; 1126#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1125#L39-3 havoc #t~post8;havoc #t~mem7; 1051#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1114#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1113#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1104#L34-1 assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 1102#gFINAL assume true; 1103#gEXIT >#56#return; 1120#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 1118#gFINAL assume true; 1101#gEXIT >#56#return; 1100#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 1099#gFINAL assume true; 1097#gEXIT >#52#return; 1064#L25 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1066#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1070#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 1071#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 1057#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1058#gENTRY [2018-10-27 06:10:31,599 INFO L795 eck$LassoCheckResult]: Loop: 1058#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1075#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1076#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1081#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1087#L39-1 #t~post8 := #t~mem7; 1090#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1092#L39-3 havoc #t~post8;havoc #t~mem7; 1056#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1058#gENTRY [2018-10-27 06:10:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash -310123531, now seen corresponding path program 2 times [2018-10-27 06:10:31,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:32,001 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 06:10:32,230 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 06:10:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 06:10:32,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:32,361 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd0b4f75-ad86-4ab7-a874-afac254fce00/bin-2019/uautomizer/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 [2018-10-27 06:10:32,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:10:32,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:10:32,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:32,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:32,425 INFO L477 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 [2018-10-27 06:10:32,427 INFO L477 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 [2018-10-27 06:10:32,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-27 06:10:32,610 INFO L477 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 [2018-10-27 06:10:32,612 INFO L477 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 [2018-10-27 06:10:32,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:32,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-10-27 06:10:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 06:10:32,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:32,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2018-10-27 06:10:32,696 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:32,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 58123592, now seen corresponding path program 2 times [2018-10-27 06:10:32,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:32,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:32,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 06:10:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=346, Unknown=6, NotChecked=0, Total=420 [2018-10-27 06:10:32,799 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. cyclomatic complexity: 12 Second operand 21 states. [2018-10-27 06:10:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:33,191 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2018-10-27 06:10:33,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 06:10:33,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 106 transitions. [2018-10-27 06:10:33,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:33,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 87 states and 97 transitions. [2018-10-27 06:10:33,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-10-27 06:10:33,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-10-27 06:10:33,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 97 transitions. [2018-10-27 06:10:33,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:33,195 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-10-27 06:10:33,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 97 transitions. [2018-10-27 06:10:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-10-27 06:10:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-27 06:10:33,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-10-27 06:10:33,207 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-10-27 06:10:33,207 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-10-27 06:10:33,207 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:33,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 91 transitions. [2018-10-27 06:10:33,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:10:33,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:33,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:33,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:33,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:33,213 INFO L793 eck$LassoCheckResult]: Stem: 1448#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1416#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset; 1409#L60 SUMMARY for call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L60 1403#L60-1 havoc main_#t~nondet13; 1404#L61 SUMMARY for call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L61 1441#L61-1 havoc main_#t~nondet14; 1417#L63 SUMMARY for call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4); srcloc: L63 1418#L63-1 main_#t~short17 := main_#t~mem15 < 0; 1444#L63-2 assume !main_#t~short17; 1440#L63-4 SUMMARY for call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L63-4 1436#L63-5 main_#t~short17 := main_#t~mem16 < 0; 1437#L63-6 assume !main_#t~short17;havoc main_#t~short17;havoc main_#t~mem16;havoc main_#t~mem15; 1455#L66 SUMMARY for call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); srcloc: L66 1420#L66-1 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 1419#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1421#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 1427#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 1428#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1429#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1449#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1467#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1466#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1451#L39-1 #t~post8 := #t~mem7; 1452#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1454#L39-3 havoc #t~post8;havoc #t~mem7; 1434#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1473#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1474#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1468#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1469#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1485#L39-1 #t~post8 := #t~mem7; 1484#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1483#L39-3 havoc #t~post8;havoc #t~mem7; 1433#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1473#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1474#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1468#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1469#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1485#L39-1 #t~post8 := #t~mem7; 1484#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1483#L39-3 havoc #t~post8;havoc #t~mem7; 1433#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1473#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1432#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1435#L34-1 assume #t~mem5 < 0;havoc #t~mem5;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 1439#gFINAL assume true; 1442#gEXIT >#56#return; 1443#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 1486#gFINAL assume true; 1465#gEXIT >#56#return; 1462#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 1464#gFINAL assume true; 1461#gEXIT >#56#return; 1460#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~np~0.base, ~np~0.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 1459#gFINAL assume true; 1457#gEXIT >#52#return; 1423#L25 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1422#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1425#L17 assume !(~v < 0);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset; 1426#L23 SUMMARY for call write~int(~v + 1, ~tmp~0.base, ~tmp~0.offset, 4); srcloc: L23 1411#L23-1 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1412#gENTRY [2018-10-27 06:10:33,213 INFO L795 eck$LassoCheckResult]: Loop: 1412#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset; 1430#L34 SUMMARY for call #t~mem5 := read~int(~p.base, ~p.offset, 4); srcloc: L34 1431#L34-1 assume !(#t~mem5 < 0);havoc #t~mem5; 1438#L39 SUMMARY for call #t~mem7 := read~int(~p.base, ~p.offset, 4); srcloc: L39 1445#L39-1 #t~post8 := #t~mem7; 1450#L39-2 SUMMARY for call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4); srcloc: L39-2 1453#L39-3 havoc #t~post8;havoc #t~mem7; 1410#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 1412#gENTRY [2018-10-27 06:10:33,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1178542563, now seen corresponding path program 3 times [2018-10-27 06:10:33,214 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:33,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 58123592, now seen corresponding path program 3 times [2018-10-27 06:10:33,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:33,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1366230314, now seen corresponding path program 4 times [2018-10-27 06:10:33,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:33,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:33,784 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-27 06:10:34,329 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 130 [2018-10-27 06:10:34,486 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-27 06:10:34,962 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 144 [2018-10-27 06:10:35,544 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 152 [2018-10-27 06:10:36,341 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 158 [2018-10-27 06:10:36,449 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-10-27 06:10:36,610 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-27 06:10:36,908 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134 [2018-10-27 06:10:37,139 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2018-10-27 06:10:37,396 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-10-27 06:10:37,926 WARN L179 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 160 [2018-10-27 06:10:38,091 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-27 06:10:38,107 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:38,108 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:38,108 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:38,108 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:38,108 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:38,108 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:38,108 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:38,108 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:38,108 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:10:38,108 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:38,108 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:38,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:38,661 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:38,661 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:38,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:38,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:38,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:38,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,840 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,853 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:38,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,854 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:38,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:38,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:38,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:38,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:38,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:38,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:38,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:38,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:38,885 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:38,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:38,888 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-10-27 06:10:38,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:38,889 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:38,889 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:38,890 INFO L519 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 [] [2018-10-27 06:10:38,989 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-10-27 06:10:39,029 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:10:39,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,334 INFO L477 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 39 treesize of output 38 [2018-10-27 06:10:39,336 INFO L477 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 38 treesize of output 29 [2018-10-27 06:10:39,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:39,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-10-27 06:10:39,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 105 states and 112 transitions. Complement of second has 31 states. [2018-10-27 06:10:39,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-10-27 06:10:39,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 61 letters. Loop has 8 letters. [2018-10-27 06:10:39,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:39,552 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:39,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:39,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:39,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:39,866 INFO L477 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 39 treesize of output 38 [2018-10-27 06:10:39,890 INFO L477 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 38 treesize of output 29 [2018-10-27 06:10:39,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:39,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:39,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-10-27 06:10:39,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-10-27 06:10:40,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 105 states and 112 transitions. Complement of second has 31 states. [2018-10-27 06:10:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2018-10-27 06:10:40,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 31 transitions. Stem has 61 letters. Loop has 8 letters. [2018-10-27 06:10:40,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:40,188 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:40,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:40,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:40,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:40,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:40,370 INFO L477 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 39 treesize of output 38 [2018-10-27 06:10:40,375 INFO L477 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 38 treesize of output 29 [2018-10-27 06:10:40,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:40,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:40,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:10:40,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-10-27 06:10:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:40,402 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 7 loop predicates [2018-10-27 06:10:40,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-10-27 06:10:40,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 91 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 147 states and 154 transitions. Complement of second has 31 states. [2018-10-27 06:10:40,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:10:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-10-27 06:10:40,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 61 letters. Loop has 8 letters. [2018-10-27 06:10:40,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:40,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 69 letters. Loop has 8 letters. [2018-10-27 06:10:40,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:40,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 61 letters. Loop has 16 letters. [2018-10-27 06:10:40,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:40,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 154 transitions. [2018-10-27 06:10:40,753 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:40,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 0 states and 0 transitions. [2018-10-27 06:10:40,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:40,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:40,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:40,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:40,754 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:40,754 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:40,754 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:40,754 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:40,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:40,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:40,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:40,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:40 BoogieIcfgContainer [2018-10-27 06:10:40,760 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:40,760 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:40,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:40,761 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:40,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:21" (3/4) ... [2018-10-27 06:10:40,764 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:40,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:40,765 INFO L168 Benchmark]: Toolchain (without parser) took 20326.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 960.7 MB in the beginning and 1.2 GB in the end (delta: -231.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:40,770 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:40,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.95 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:40,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:40,771 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:40,771 INFO L168 Benchmark]: RCFGBuilder took 585.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:40,771 INFO L168 Benchmark]: BuchiAutomizer took 19505.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:40,772 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:40,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.95 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 950.0 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 35.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 947.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 585.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19505.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -58.8 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 9 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 10 locations. 4 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.4s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 15.4s. Construction of modules took 1.0s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 21/21 HoareTripleCheckerStatistics: 247 SDtfs, 229 SDslu, 615 SDs, 0 SdLazy, 626 SolverSat, 109 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI2 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital381 mio100 ax100 hnf100 lsp98 ukn33 mio100 lsp21 div100 bol100 ite100 ukn100 eq195 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...