./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/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 32bit --witnessprinter.graph.data.programhash 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:53,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:53,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:53,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:53,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:53,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:53,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:53,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:53,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:53,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:53,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:53,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:53,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:53,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:53,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:53,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:53,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:53,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:53,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:53,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:53,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:53,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:53,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:53,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:53,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:53,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:53,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:53,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:53,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:53,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:53,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:53,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:53,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:53,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:53,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:53,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:53,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:53,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:53,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:53,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:53,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:53,151 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:53,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:53,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:53,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:53,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:53,168 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:53,168 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:53,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:53,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:53,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:53,171 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:53,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:53,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:53,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:53,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:53,171 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:53,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:53,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:53,176 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:53,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:53,177 INFO L138 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_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 [2019-10-22 08:59:53,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:53,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:53,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:53,227 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:53,227 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:53,228 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-10-22 08:59:53,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/data/006f6906e/10322c0ffe314438a29971d044746406/FLAG87fe53775 [2019-10-22 08:59:53,776 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:53,777 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-10-22 08:59:53,794 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/data/006f6906e/10322c0ffe314438a29971d044746406/FLAG87fe53775 [2019-10-22 08:59:54,248 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/data/006f6906e/10322c0ffe314438a29971d044746406 [2019-10-22 08:59:54,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:54,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:54,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:54,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:54,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:54,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b9f325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54, skipping insertion in model container [2019-10-22 08:59:54,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,269 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:54,319 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:54,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:54,746 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:54,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:54,891 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:54,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54 WrapperNode [2019-10-22 08:59:54,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:54,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:54,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:54,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:54,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:54,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:54,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:54,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:54,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... [2019-10-22 08:59:54,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:54,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:54,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:54,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:54,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/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 [2019-10-22 08:59:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:59:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:59:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:55,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:59:55,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:55,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 08:59:55,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:55,323 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:55,323 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-10-22 08:59:55,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:55 BoogieIcfgContainer [2019-10-22 08:59:55,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:55,325 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:55,326 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:55,329 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:55,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:55,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:54" (1/3) ... [2019-10-22 08:59:55,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@793f301f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:55, skipping insertion in model container [2019-10-22 08:59:55,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:55,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:54" (2/3) ... [2019-10-22 08:59:55,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@793f301f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:55, skipping insertion in model container [2019-10-22 08:59:55,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:55,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:55" (3/3) ... [2019-10-22 08:59:55,333 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2019-10-22 08:59:55,374 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:55,375 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:55,375 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:55,375 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:55,375 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:55,375 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:55,375 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:55,375 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:55,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-10-22 08:59:55,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:59:55,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:55,414 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:55,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-10-22 08:59:55,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:59:55,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:55,420 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 9#L521true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 7#L522true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 28#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 11#L530true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 18#L790true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 24#L791-3true [2019-10-22 08:59:55,420 INFO L793 eck$LassoCheckResult]: Loop: 24#L791-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 6#L791-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 24#L791-3true [2019-10-22 08:59:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2019-10-22 08:59:55,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846407875] [2019-10-22 08:59:55,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:55,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846407875] [2019-10-22 08:59:55,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:55,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:55,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595909974] [2019-10-22 08:59:55,597 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:55,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-10-22 08:59:55,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581857326] [2019-10-22 08:59:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:55,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:55,709 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-10-22 08:59:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:55,768 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-10-22 08:59:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:55,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-10-22 08:59:55,772 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-10-22 08:59:55,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-10-22 08:59:55,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-10-22 08:59:55,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-10-22 08:59:55,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-10-22 08:59:55,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:55,779 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-10-22 08:59:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-10-22 08:59:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-10-22 08:59:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:59:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-10-22 08:59:55,805 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 08:59:55,806 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-10-22 08:59:55,806 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:55,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-10-22 08:59:55,806 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-10-22 08:59:55,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:55,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:55,807 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:55,807 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:59:55,808 INFO L791 eck$LassoCheckResult]: Stem: 104#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 101#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 102#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 99#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 100#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 106#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 91#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 92#L791-3 [2019-10-22 08:59:55,808 INFO L793 eck$LassoCheckResult]: Loop: 92#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 98#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 92#L791-3 [2019-10-22 08:59:55,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2019-10-22 08:59:55,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24767656] [2019-10-22 08:59:55,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,839 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2019-10-22 08:59:55,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362231784] [2019-10-22 08:59:55,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,855 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2019-10-22 08:59:55,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:55,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371171282] [2019-10-22 08:59:55,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:55,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:55,892 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:56,191 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-22 08:59:56,301 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:56,302 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:56,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:56,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:56,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:56,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:56,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:56,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:56,302 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2019-10-22 08:59:56,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:56,303 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:56,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,593 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-22 08:59:56,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:56,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:57,180 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-22 08:59:57,202 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:57,208 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:57,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,211 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,212 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,212 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,212 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,214 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,214 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,216 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,218 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,218 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,219 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,219 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,221 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,222 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,228 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,229 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,231 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,231 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,235 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,235 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,235 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,238 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,238 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,240 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,241 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,241 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,242 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,242 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,257 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,258 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,261 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,267 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,270 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,279 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,294 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,294 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,296 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,296 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,311 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,315 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,316 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,316 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,317 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,317 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,322 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:57,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:57,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:57,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,329 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,329 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,332 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,334 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,334 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,343 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,349 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,349 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:57,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:57,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:57,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:57,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:57,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:57,370 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:57,371 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:57,455 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:57,474 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:57,475 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:57,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:57,478 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:57,478 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:57,479 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~2) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~2 Supporting invariants [] [2019-10-22 08:59:57,499 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:59:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:57,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:57,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:57,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:57,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:57,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:59:57,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:59:57,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 6 states. [2019-10-22 08:59:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-10-22 08:59:57,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:59:57,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:59:57,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:59:57,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:57,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2019-10-22 08:59:57,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:59:57,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 24 states and 31 transitions. [2019-10-22 08:59:57,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:59:57,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:59:57,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2019-10-22 08:59:57,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:57,613 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:59:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2019-10-22 08:59:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 08:59:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:59:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-10-22 08:59:57,615 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:59:57,615 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-10-22 08:59:57,616 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:57,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-10-22 08:59:57,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:59:57,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:57,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:57,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:57,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:57,617 INFO L791 eck$LassoCheckResult]: Stem: 246#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 243#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 244#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 240#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 241#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 247#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 231#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 232#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 242#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 245#L766-3 [2019-10-22 08:59:57,618 INFO L793 eck$LassoCheckResult]: Loop: 245#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 225#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 226#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 235#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 237#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 245#L766-3 [2019-10-22 08:59:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2019-10-22 08:59:57,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950775802] [2019-10-22 08:59:57,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:57,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950775802] [2019-10-22 08:59:57,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:57,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:57,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331867395] [2019-10-22 08:59:57,653 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2019-10-22 08:59:57,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256632787] [2019-10-22 08:59:57,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,665 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:57,808 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:59:57,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:57,867 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:59:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:57,912 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-10-22 08:59:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:57,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-10-22 08:59:57,913 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-10-22 08:59:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-10-22 08:59:57,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-10-22 08:59:57,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-10-22 08:59:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-10-22 08:59:57,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:57,915 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-10-22 08:59:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-10-22 08:59:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-10-22 08:59:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:59:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-10-22 08:59:57,918 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:59:57,918 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:59:57,918 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:57,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-10-22 08:59:57,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:59:57,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:57,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:57,919 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:57,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:57,920 INFO L791 eck$LassoCheckResult]: Stem: 328#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 324#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 325#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 327#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 332#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 333#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 335#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 334#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 326#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 329#L766-3 [2019-10-22 08:59:57,920 INFO L793 eck$LassoCheckResult]: Loop: 329#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 307#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 308#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 317#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 319#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 329#L766-3 [2019-10-22 08:59:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2019-10-22 08:59:57,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090779866] [2019-10-22 08:59:57,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:57,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090779866] [2019-10-22 08:59:57,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:57,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:57,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695633190] [2019-10-22 08:59:57,950 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2019-10-22 08:59:57,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:57,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219473986] [2019-10-22 08:59:57,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:57,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:57,961 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,099 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:59:58,164 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:58,165 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:59:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:58,191 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-22 08:59:58,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:59:58,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-10-22 08:59:58,193 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:59:58,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2019-10-22 08:59:58,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-10-22 08:59:58,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-10-22 08:59:58,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2019-10-22 08:59:58,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:58,194 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-22 08:59:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2019-10-22 08:59:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 08:59:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:59:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-10-22 08:59:58,196 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 08:59:58,196 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 08:59:58,196 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:58,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-10-22 08:59:58,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-10-22 08:59:58,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:58,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:58,198 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:58,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:58,198 INFO L791 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 395#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 396#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 393#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 394#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 400#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 384#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 385#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 391#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 392#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 397#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 399#L766-3 [2019-10-22 08:59:58,198 INFO L793 eck$LassoCheckResult]: Loop: 399#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 378#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 379#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 388#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 390#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 399#L766-3 [2019-10-22 08:59:58,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2019-10-22 08:59:58,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283823995] [2019-10-22 08:59:58,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,231 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2019-10-22 08:59:58,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303239711] [2019-10-22 08:59:58,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,249 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2019-10-22 08:59:58,254 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:58,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406851558] [2019-10-22 08:59:58,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:58,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:58,318 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:58,445 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:59:58,811 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2019-10-22 08:59:58,914 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:58,914 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:58,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:58,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:58,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:58,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:58,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:58,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:58,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2019-10-22 08:59:58,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:58,914 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:58,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,162 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-10-22 08:59:59,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:59,766 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:59,766 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:59,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,769 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,769 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,770 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,770 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,773 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,773 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,786 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,786 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,791 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,791 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,791 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,792 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,793 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,794 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,795 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,796 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,796 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,799 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,803 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,804 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,804 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,818 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,821 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,821 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,821 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,821 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,821 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,823 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 08:59:59,823 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:59,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,830 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-10-22 08:59:59,830 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:59,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,882 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,882 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,885 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,887 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,890 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,891 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,892 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,893 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,893 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,896 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,896 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,898 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,898 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,899 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,899 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,905 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,905 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,910 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,911 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,912 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,912 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,912 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,915 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:59,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,916 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:59,916 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:59,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,918 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,918 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:59,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:59,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:59,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:59,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:59,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:59,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:59,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:59,970 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:00,007 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:00,009 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:00:00,009 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:00,010 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:00,010 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:00,010 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2019-10-22 09:00:00,038 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:00,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:00,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:00,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:00,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:00:00,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2019-10-22 09:00:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-10-22 09:00:00,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2019-10-22 09:00:00,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2019-10-22 09:00:00,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2019-10-22 09:00:00,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:00,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-10-22 09:00:00,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 09:00:00,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2019-10-22 09:00:00,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 09:00:00,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 09:00:00,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-10-22 09:00:00,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:00,118 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-10-22 09:00:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-10-22 09:00:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-10-22 09:00:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:00:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-10-22 09:00:00,123 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 09:00:00,124 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-22 09:00:00,124 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:00,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-10-22 09:00:00,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:00,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:00,125 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:00,125 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:00,125 INFO L791 eck$LassoCheckResult]: Stem: 575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 572#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 573#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 570#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 571#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 577#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 560#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 561#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 568#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 569#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 574#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 576#L766-3 assume !(alloc_17_~i~0 < alloc_17_~len); 579#L766-4 alloc_17_#res := 0; 559#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 563#L781-3 [2019-10-22 09:00:00,125 INFO L793 eck$LassoCheckResult]: Loop: 563#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 562#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 563#L781-3 [2019-10-22 09:00:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2019-10-22 09:00:00,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851055103] [2019-10-22 09:00:00,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:00,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851055103] [2019-10-22 09:00:00,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:00,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:00,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109882137] [2019-10-22 09:00:00,160 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2019-10-22 09:00:00,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83322829] [2019-10-22 09:00:00,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:00,196 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 09:00:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:00,262 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-10-22 09:00:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:00,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-10-22 09:00:00,263 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-10-22 09:00:00,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2019-10-22 09:00:00,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-10-22 09:00:00,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-10-22 09:00:00,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2019-10-22 09:00:00,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:00,264 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-10-22 09:00:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2019-10-22 09:00:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-10-22 09:00:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 09:00:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-10-22 09:00:00,267 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-10-22 09:00:00,267 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-10-22 09:00:00,267 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:00,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-10-22 09:00:00,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:00,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:00,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:00,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:00,271 INFO L791 eck$LassoCheckResult]: Stem: 685#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 679#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 680#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 684#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 695#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 688#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 689#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 694#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 675#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 676#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 686#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 687#L766-3 assume !(alloc_17_~i~0 < alloc_17_~len); 692#L766-4 alloc_17_#res := 0; 666#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 670#L781-3 [2019-10-22 09:00:00,271 INFO L793 eck$LassoCheckResult]: Loop: 670#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 669#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 670#L781-3 [2019-10-22 09:00:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2019-10-22 09:00:00,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238636342] [2019-10-22 09:00:00,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:00,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238636342] [2019-10-22 09:00:00,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:00,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:00,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618120447] [2019-10-22 09:00:00,308 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2019-10-22 09:00:00,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350062149] [2019-10-22 09:00:00,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:00,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:00,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:00,355 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-10-22 09:00:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:00,399 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-22 09:00:00,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:00,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2019-10-22 09:00:00,404 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 09:00:00,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2019-10-22 09:00:00,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-10-22 09:00:00,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-10-22 09:00:00,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2019-10-22 09:00:00,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:00,405 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-10-22 09:00:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2019-10-22 09:00:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-10-22 09:00:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:00:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-10-22 09:00:00,407 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 09:00:00,407 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-10-22 09:00:00,407 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:00,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-10-22 09:00:00,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:00,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:00,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:00,408 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:00,408 INFO L791 eck$LassoCheckResult]: Stem: 782#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 779#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 780#L521 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 777#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 778#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 784#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 767#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 768#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 775#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 776#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 781#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 783#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 759#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 760#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 771#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 772#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 764#L773-3 [2019-10-22 09:00:00,408 INFO L793 eck$LassoCheckResult]: Loop: 764#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 763#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 764#L773-3 [2019-10-22 09:00:00,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2019-10-22 09:00:00,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992702409] [2019-10-22 09:00:00,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,425 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2019-10-22 09:00:00,426 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358292363] [2019-10-22 09:00:00,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,426 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2019-10-22 09:00:00,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120346265] [2019-10-22 09:00:00,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:00,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120346265] [2019-10-22 09:00:00,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:00,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:00:00,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164090647] [2019-10-22 09:00:00,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:00,545 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-10-22 09:00:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:00,642 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-10-22 09:00:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:00,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2019-10-22 09:00:00,644 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-10-22 09:00:00,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2019-10-22 09:00:00,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-10-22 09:00:00,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-10-22 09:00:00,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2019-10-22 09:00:00,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:00,645 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-10-22 09:00:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2019-10-22 09:00:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-10-22 09:00:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 09:00:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-10-22 09:00:00,648 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-10-22 09:00:00,648 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-10-22 09:00:00,648 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:00,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-10-22 09:00:00,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:00,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:00,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:00,649 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:00,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:00,649 INFO L791 eck$LassoCheckResult]: Stem: 907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 901#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 902#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 906#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 917#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 918#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 889#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 890#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 903#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 904#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 905#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 913#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 880#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 881#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 893#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 894#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 886#L773-3 assume !(alloc_17_~j~0 >= 0); 887#L773-4 alloc_17_#res := 3; 888#L777 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 892#L781-3 [2019-10-22 09:00:00,649 INFO L793 eck$LassoCheckResult]: Loop: 892#L781-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 891#L781-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 892#L781-3 [2019-10-22 09:00:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash 419216258, now seen corresponding path program 1 times [2019-10-22 09:00:00,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848715449] [2019-10-22 09:00:00,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2019-10-22 09:00:00,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245005932] [2019-10-22 09:00:00,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:00,678 INFO L82 PathProgramCache]: Analyzing trace with hash -860099164, now seen corresponding path program 1 times [2019-10-22 09:00:00,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:00,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317906089] [2019-10-22 09:00:00,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:00,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:00,702 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:01,309 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 158 [2019-10-22 09:00:01,470 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-10-22 09:00:01,471 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:01,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:01,472 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:01,472 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:01,472 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:01,472 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:01,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:01,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:01,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration9_Lasso [2019-10-22 09:00:01,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:01,472 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:01,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,710 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-22 09:00:01,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:01,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:02,261 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:02,261 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:02,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,262 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,262 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,263 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,264 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,264 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,271 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,272 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,273 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,273 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,275 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,278 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,279 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,280 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,281 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,281 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,281 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,282 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,282 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,285 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,286 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,286 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,289 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,294 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,295 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,295 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,304 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,304 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,304 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,305 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,307 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,307 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,309 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,309 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,311 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 09:00:02,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,313 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-10-22 09:00:02,313 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:02,321 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:02,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:02,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:02,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:02,323 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:02,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:02,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:02,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:02,325 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:02,325 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:02,359 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:02,394 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:00:02,395 INFO L444 ModelExtractionUtils]: 47 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:00:02,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:02,400 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:02,400 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:02,400 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2019-10-22 09:00:02,430 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:02,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:02,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-10-22 09:00:02,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 49 states and 64 transitions. Complement of second has 4 states. [2019-10-22 09:00:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2019-10-22 09:00:02,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2019-10-22 09:00:02,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:00:02,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2019-10-22 09:00:02,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:02,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-10-22 09:00:02,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:02,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 27 transitions. [2019-10-22 09:00:02,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:00:02,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:00:02,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-10-22 09:00:02,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:02,500 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 09:00:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-10-22 09:00:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-22 09:00:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:00:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-22 09:00:02,501 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 09:00:02,501 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 09:00:02,501 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:02,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-10-22 09:00:02,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:02,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:02,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:02,502 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:02,502 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:02,503 INFO L791 eck$LassoCheckResult]: Stem: 1115#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1111#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1112#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1109#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1110#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1116#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1101#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1102#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1107#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1108#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1113#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1114#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1097#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1098#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1105#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1106#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1117#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1095#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1096#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1103#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1104#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1100#L773-3 [2019-10-22 09:00:02,503 INFO L793 eck$LassoCheckResult]: Loop: 1100#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1099#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1100#L773-3 [2019-10-22 09:00:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash 718228858, now seen corresponding path program 1 times [2019-10-22 09:00:02,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938113754] [2019-10-22 09:00:02,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:02,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938113754] [2019-10-22 09:00:02,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:02,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:02,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022652328] [2019-10-22 09:00:02,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2019-10-22 09:00:02,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631154323] [2019-10-22 09:00:02,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:02,625 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:00:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:02,644 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-10-22 09:00:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:02,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2019-10-22 09:00:02,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:02,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 31 transitions. [2019-10-22 09:00:02,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:00:02,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 09:00:02,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-10-22 09:00:02,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:02,646 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-22 09:00:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-10-22 09:00:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-10-22 09:00:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:00:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-22 09:00:02,647 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 09:00:02,647 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-22 09:00:02,648 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:02,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-10-22 09:00:02,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:02,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:02,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:02,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:02,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:02,649 INFO L791 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1173#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1174#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1171#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1172#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1178#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1163#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1164#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1169#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1170#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1175#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1177#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1159#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1160#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1167#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1168#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1179#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1157#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1158#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1165#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1166#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1162#L773-3 [2019-10-22 09:00:02,649 INFO L793 eck$LassoCheckResult]: Loop: 1162#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1161#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1162#L773-3 [2019-10-22 09:00:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,649 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2019-10-22 09:00:02,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039789267] [2019-10-22 09:00:02,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039789267] [2019-10-22 09:00:02,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972175289] [2019-10-22 09:00:02,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2d6275c-42cf-4e31-9c11-594b5e924a12/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:00:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:02,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:00:02,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:02,823 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:02,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-10-22 09:00:02,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976364755] [2019-10-22 09:00:02,824 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,824 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2019-10-22 09:00:02,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363342066] [2019-10-22 09:00:02,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:02,835 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:02,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:02,914 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-10-22 09:00:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:02,978 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-10-22 09:00:02,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:02,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-10-22 09:00:02,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:02,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2019-10-22 09:00:02,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:00:02,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:00:02,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-10-22 09:00:02,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:02,980 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-10-22 09:00:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-10-22 09:00:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-22 09:00:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 09:00:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-22 09:00:02,982 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 09:00:02,982 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 09:00:02,982 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 09:00:02,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2019-10-22 09:00:02,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:02,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:02,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:02,983 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:02,983 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:02,984 INFO L791 eck$LassoCheckResult]: Stem: 1311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1308#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1309#L521 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1306#L522 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1307#L527 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1314#L530 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1298#L790 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1299#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1304#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1305#L791-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1310#L791-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1316#L791-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1312#L791-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1313#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1294#L527-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1295#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1302#L768 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1303#L766-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1315#L766-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1292#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1293#L530-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1300#L768 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1301#L768-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1297#L773-3 [2019-10-22 09:00:02,984 INFO L793 eck$LassoCheckResult]: Loop: 1297#L773-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1296#L773-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1297#L773-3 [2019-10-22 09:00:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2019-10-22 09:00:02,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:02,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944684402] [2019-10-22 09:00:02,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:02,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,050 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 4 times [2019-10-22 09:00:03,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531929686] [2019-10-22 09:00:03,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2019-10-22 09:00:03,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:03,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045494323] [2019-10-22 09:00:03,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:03,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:03,082 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:04,449 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 251 DAG size of output: 214 [2019-10-22 09:00:04,494 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:04,707 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2019-10-22 09:00:04,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:04,712 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:04,901 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-10-22 09:00:04,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:04,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:04,904 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:335, output treesize:327 [2019-10-22 09:00:05,096 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-10-22 09:00:05,099 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:05,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:05,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:05,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:05,100 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:05,100 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:05,100 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:05,100 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:05,100 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration12_Lasso [2019-10-22 09:00:05,100 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:05,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:05,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,372 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-10-22 09:00:05,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:05,881 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-22 09:00:05,969 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:05,969 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:05,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,970 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:05,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:05,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:05,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,972 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,973 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,973 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,975 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,975 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,978 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,978 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:05,980 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,980 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,980 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,980 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:05,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:05,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,981 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,981 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:05,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,981 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:05,981 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:05,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,982 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,983 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,983 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,987 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,987 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,989 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:05,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,991 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:05,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:05,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,993 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:05,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,996 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:05,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:05,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:05,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:05,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:05,997 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:05,997 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:05,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:05,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:05,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:05,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,001 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,001 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,001 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,002 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,002 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,007 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,007 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,010 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,011 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,011 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,014 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,014 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,015 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,016 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,016 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,018 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,019 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,020 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,021 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,021 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,023 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,023 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,023 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,024 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,027 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,028 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,028 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,028 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,028 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,028 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,028 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,028 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,029 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,031 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 09:00:06,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,031 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,033 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-10-22 09:00:06,033 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,045 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,049 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:06,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,052 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:06,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:06,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:06,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:06,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:06,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:06,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:06,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:06,055 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:06,055 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:06,074 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:06,102 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:06,102 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:00:06,103 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:06,103 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:06,104 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:06,104 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2019-10-22 09:00:06,139 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 09:00:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:06,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:06,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:06,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:00:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:06,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:00:06,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:00:06,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2019-10-22 09:00:06,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-10-22 09:00:06,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2019-10-22 09:00:06,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:06,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2019-10-22 09:00:06,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:06,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2019-10-22 09:00:06,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:06,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-10-22 09:00:06,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:06,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:06,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:06,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:06,200 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 09:00:06,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:06,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:06,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:06,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:06 BoogieIcfgContainer [2019-10-22 09:00:06,211 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:06,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:06,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:06,211 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:06,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:55" (3/4) ... [2019-10-22 09:00:06,215 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:06,216 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:06,217 INFO L168 Benchmark]: Toolchain (without parser) took 11963.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 180.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:06,218 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:06,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:06,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:06,220 INFO L168 Benchmark]: Boogie Preprocessor took 31.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:06,220 INFO L168 Benchmark]: RCFGBuilder took 351.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:06,221 INFO L168 Benchmark]: BuchiAutomizer took 10886.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:06,225 INFO L168 Benchmark]: Witness Printer took 4.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:06,226 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 351.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10886.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 9.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 358 SDtfs, 494 SDslu, 543 SDs, 0 SdLazy, 267 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital316 mio100 ax110 hnf100 lsp84 ukn59 mio100 lsp53 div100 bol100 ite100 ukn100 eq190 hnf89 smp96 dnf168 smp79 tf100 neg98 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 57ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 3 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 24 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...