./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_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/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/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 09bd2b4d877b02d6e4448e44897944243667e3ce ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:37:24,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:37:24,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:37:24,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:37:24,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:37:24,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:37:24,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:37:24,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:37:24,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:37:24,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:37:24,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:37:24,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:37:24,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:37:24,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:37:24,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:37:24,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:37:24,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:37:24,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:37:24,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:37:24,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:37:24,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:37:24,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:37:24,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:37:24,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:37:24,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:37:24,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:37:24,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:37:24,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:37:24,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:37:24,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:37:24,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:37:24,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:37:24,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:37:24,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:37:24,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:37:24,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:37:24,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:37:24,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:37:24,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:37:24,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:37:24,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:37:24,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:37:24,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:37:24,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:37:24,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:37:24,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:37:24,349 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:37:24,350 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:37:24,350 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:37:24,350 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:37:24,350 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:37:24,350 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:37:24,351 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:37:24,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:37:24,351 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:37:24,351 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:37:24,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:37:24,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:37:24,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:37:24,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:37:24,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:37:24,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:37:24,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:37:24,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:37:24,353 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:37:24,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:37:24,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:37:24,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:37:24,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:37:24,354 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:37:24,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:37:24,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:37:24,364 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:37:24,365 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:37:24,365 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/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/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 -> 09bd2b4d877b02d6e4448e44897944243667e3ce [2019-11-15 23:37:24,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:37:24,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:37:24,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:37:24,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:37:24,416 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:37:24,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2019-11-15 23:37:24,478 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/data/758d806fc/0b8bbf8e7cf94193a84d7c2dd3d226a6/FLAG9a05ce9d6 [2019-11-15 23:37:25,015 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:37:25,016 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2019-11-15 23:37:25,036 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/data/758d806fc/0b8bbf8e7cf94193a84d7c2dd3d226a6/FLAG9a05ce9d6 [2019-11-15 23:37:25,488 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/bin/uautomizer/data/758d806fc/0b8bbf8e7cf94193a84d7c2dd3d226a6 [2019-11-15 23:37:25,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:37:25,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:37:25,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:25,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:37:25,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:37:25,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:25" (1/1) ... [2019-11-15 23:37:25,500 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 15.11 11:37:25, skipping insertion in model container [2019-11-15 23:37:25,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:25" (1/1) ... [2019-11-15 23:37:25,510 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:37:25,564 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:37:26,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:26,056 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:37:26,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:26,201 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:37:26,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26 WrapperNode [2019-11-15 23:37:26,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:26,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:37:26,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:37:26,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:37:26,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:37:26,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:37:26,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:37:26,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:37:26,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... [2019-11-15 23:37:26,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:37:26,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:37:26,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:37:26,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:37:26,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_50eaf117-183d-4388-bb27-fcd2a87e3f19/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-11-15 23:37:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:37:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:37:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:37:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:37:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:37:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 23:37:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:37:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:37:26,682 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:37:26,682 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-15 23:37:26,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:26 BoogieIcfgContainer [2019-11-15 23:37:26,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:37:26,684 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:37:26,684 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:37:26,687 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:37:26,688 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:26,688 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:37:25" (1/3) ... [2019-11-15 23:37:26,689 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d86ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:37:26, skipping insertion in model container [2019-11-15 23:37:26,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:26,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:26" (2/3) ... [2019-11-15 23:37:26,690 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d86ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:37:26, skipping insertion in model container [2019-11-15 23:37:26,690 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:37:26,690 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:26" (3/3) ... [2019-11-15 23:37:26,692 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18_2.i [2019-11-15 23:37:26,736 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:37:26,736 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:37:26,736 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:37:26,736 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:37:26,736 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:37:26,736 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:37:26,737 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:37:26,737 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:37:26,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:37:26,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:37:26,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:26,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:26,773 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:26,773 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:26,773 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:37:26,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-11-15 23:37:26,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:37:26,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:26,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:26,775 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:26,775 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:26,779 INFO L791 eck$LassoCheckResult]: Stem: 12#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); 10#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 18#L527true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 14#L530true entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 9#L767true assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 13#L768-3true [2019-11-15 23:37:26,779 INFO L793 eck$LassoCheckResult]: Loop: 13#L768-3true assume !!(entry_point_~i~0 < entry_point_~len~0);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; 4#L527-1true 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; 16#L530-1true entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 6#L770true assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 11#L768-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 13#L768-3true [2019-11-15 23:37:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:26,784 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 23:37:26,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:26,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249331721] [2019-11-15 23:37:26,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:26,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:26,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:26,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249331721] [2019-11-15 23:37:26,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:26,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:26,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141658002] [2019-11-15 23:37:26,971 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:37:26,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 1 times [2019-11-15 23:37:26,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:26,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073687587] [2019-11-15 23:37:26,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:26,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,019 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:27,241 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 23:37:27,368 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:37:27,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:27,386 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-11-15 23:37:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:27,461 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-11-15 23:37:27,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:27,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-11-15 23:37:27,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 23:37:27,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 23 transitions. [2019-11-15 23:37:27,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:37:27,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:37:27,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-15 23:37:27,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:37:27,472 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-15 23:37:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-15 23:37:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-11-15 23:37:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 23:37:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-15 23:37:27,497 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:37:27,498 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-15 23:37:27,498 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:37:27,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2019-11-15 23:37:27,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-15 23:37:27,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:27,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:27,499 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:27,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 23:37:27,500 INFO L791 eck$LassoCheckResult]: Stem: 71#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); 69#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 70#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; 72#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 67#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 68#L768-3 [2019-11-15 23:37:27,500 INFO L793 eck$LassoCheckResult]: Loop: 68#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 62#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; 63#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 64#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 66#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 68#L768-3 [2019-11-15 23:37:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 28693831, now seen corresponding path program 1 times [2019-11-15 23:37:27,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:27,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660041029] [2019-11-15 23:37:27,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash 49720347, now seen corresponding path program 2 times [2019-11-15 23:37:27,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:27,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063640732] [2019-11-15 23:37:27,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,558 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:27,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1173278059, now seen corresponding path program 1 times [2019-11-15 23:37:27,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:27,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545347467] [2019-11-15 23:37:27,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:27,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:27,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:27,881 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 23:37:28,239 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-11-15 23:37:28,339 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:37:28,340 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:37:28,341 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:37:28,341 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:37:28,341 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:37:28,341 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:37:28,341 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:37:28,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:37:28,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration2_Lasso [2019-11-15 23:37:28,342 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:37:28,342 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:37:28,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,630 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-15 23:37:28,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,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-11-15 23:37:28,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:28,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-11-15 23:37:28,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-11-15 23:37:28,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:29,316 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 23:37:29,562 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:37:29,565 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:37:29,567 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-11-15 23:37:29,568 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,569 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,573 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:29,573 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:29,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,578 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-11-15 23:37:29,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:29,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,580 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:29,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:29,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,582 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-11-15 23:37:29,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:29,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:29,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:29,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,585 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-11-15 23:37:29,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,586 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,586 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,588 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:29,588 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:29,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,594 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-11-15 23:37:29,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,597 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:29,598 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:29,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,604 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-11-15 23:37:29,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,605 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:29,605 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,605 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,605 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,606 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:29,606 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:29,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,607 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-11-15 23:37:29,608 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,608 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,608 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,610 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:29,610 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:29,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,619 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-11-15 23:37:29,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,620 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:29,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,621 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:29,621 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:29,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,622 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-11-15 23:37:29,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,623 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-11-15 23:37:29,623 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:37:29,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,644 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-11-15 23:37:29,644 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 23:37:29,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:29,848 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-11-15 23:37:29,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:29,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:29,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:29,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:29,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:29,862 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:29,922 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:37:30,011 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:37:30,011 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-11-15 23:37:30,014 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:37:30,015 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:37:30,016 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:37:30,017 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~len~0, ULTIMATE.start_entry_point_~i~0) = 1*ULTIMATE.start_entry_point_~len~0 - 1*ULTIMATE.start_entry_point_~i~0 Supporting invariants [] [2019-11-15 23:37:30,036 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 23:37:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:30,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:37:30,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:30,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:37:30,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:30,123 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-11-15 23:37:30,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 23:37:30,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 4 states. [2019-11-15 23:37:30,164 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-11-15 23:37:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:37:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 23:37:30,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 5 letters. [2019-11-15 23:37:30,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:30,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 5 letters. [2019-11-15 23:37:30,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:30,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-15 23:37:30,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:30,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-11-15 23:37:30,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:37:30,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2019-11-15 23:37:30,170 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:37:30,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:37:30,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2019-11-15 23:37:30,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:37:30,173 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:37:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2019-11-15 23:37:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-15 23:37:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:37:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-15 23:37:30,177 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:37:30,177 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-15 23:37:30,177 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:37:30,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-11-15 23:37:30,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:37:30,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:30,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:30,181 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:30,181 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:37:30,181 INFO L791 eck$LassoCheckResult]: Stem: 179#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); 176#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 177#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; 180#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 174#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 175#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 166#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 167#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 170#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 171#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 164#L775-3 [2019-11-15 23:37:30,181 INFO L793 eck$LassoCheckResult]: Loop: 164#L775-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 165#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 164#L775-3 [2019-11-15 23:37:30,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1173218534, now seen corresponding path program 1 times [2019-11-15 23:37:30,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476150302] [2019-11-15 23:37:30,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,224 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 1 times [2019-11-15 23:37:30,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491944585] [2019-11-15 23:37:30,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,250 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2113389244, now seen corresponding path program 1 times [2019-11-15 23:37:30,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438210584] [2019-11-15 23:37:30,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:30,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438210584] [2019-11-15 23:37:30,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:30,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:30,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542781505] [2019-11-15 23:37:30,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:30,313 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-15 23:37:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:30,341 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-11-15 23:37:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:37:30,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2019-11-15 23:37:30,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:37:30,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2019-11-15 23:37:30,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:37:30,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:37:30,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-11-15 23:37:30,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:37:30,344 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 23:37:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-11-15 23:37:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-15 23:37:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:37:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-15 23:37:30,346 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:37:30,346 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-15 23:37:30,346 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:37:30,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-11-15 23:37:30,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:37:30,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:30,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:30,348 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:30,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:37:30,348 INFO L791 eck$LassoCheckResult]: Stem: 233#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); 230#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 231#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; 234#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 228#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 229#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 222#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 223#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 226#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 227#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 232#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 220#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 221#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 224#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 225#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 218#L775-3 [2019-11-15 23:37:30,348 INFO L793 eck$LassoCheckResult]: Loop: 218#L775-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 219#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 218#L775-3 [2019-11-15 23:37:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1659616398, now seen corresponding path program 1 times [2019-11-15 23:37:30,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596922194] [2019-11-15 23:37:30,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:30,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596922194] [2019-11-15 23:37:30,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:30,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:30,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686333725] [2019-11-15 23:37:30,378 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:37:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 2 times [2019-11-15 23:37:30,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683059722] [2019-11-15 23:37:30,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,384 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:30,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:30,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:30,417 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-15 23:37:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:30,444 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-15 23:37:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:30,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-11-15 23:37:30,445 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:37:30,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 24 transitions. [2019-11-15 23:37:30,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-15 23:37:30,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 23:37:30,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2019-11-15 23:37:30,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:37:30,446 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-15 23:37:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2019-11-15 23:37:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-11-15 23:37:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:37:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-15 23:37:30,448 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 23:37:30,448 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-15 23:37:30,448 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:37:30,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2019-11-15 23:37:30,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:37:30,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:37:30,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:37:30,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:30,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:37:30,450 INFO L791 eck$LassoCheckResult]: Stem: 283#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); 280#L-1 havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_#t~ret40.base, entry_point_#t~ret40.offset, entry_point_#t~post39, entry_point_#t~mem42.base, entry_point_#t~mem42.offset, entry_point_#t~post41, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0;entry_point_~len~0 := 10;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; 281#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; 284#L530 entry_point_#t~ret38.base, entry_point_#t~ret38.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 278#L767 assume !(entry_point_~array~0.base == 0 && entry_point_~array~0.offset == 0); 279#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 272#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; 273#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 276#L770 assume !(entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0);call write~$Pointer$(entry_point_~p~0.base, entry_point_~p~0.offset, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~0, 4); 277#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 282#L768-3 assume !!(entry_point_~i~0 < entry_point_~len~0);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; 270#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 271#L530-1 entry_point_#t~ret40.base, entry_point_#t~ret40.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~p~0.base, entry_point_~p~0.offset := entry_point_#t~ret40.base, entry_point_#t~ret40.offset;havoc entry_point_#t~ret40.base, entry_point_#t~ret40.offset; 274#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 275#L770-1 entry_point_~j~0 := entry_point_~i~0 - 1; 268#L775-3 [2019-11-15 23:37:30,450 INFO L793 eck$LassoCheckResult]: Loop: 268#L775-3 assume !!(entry_point_~j~0 >= 0);call entry_point_#t~mem42.base, entry_point_#t~mem42.offset := read~$Pointer$(entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~j~0, 4);call ULTIMATE.dealloc(entry_point_#t~mem42.base, entry_point_#t~mem42.offset);havoc entry_point_#t~mem42.base, entry_point_#t~mem42.offset; 269#L775-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 268#L775-3 [2019-11-15 23:37:30,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash 979558028, now seen corresponding path program 1 times [2019-11-15 23:37:30,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291354820] [2019-11-15 23:37:30,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,492 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2531, now seen corresponding path program 3 times [2019-11-15 23:37:30,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49951948] [2019-11-15 23:37:30,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash 757428654, now seen corresponding path program 1 times [2019-11-15 23:37:30,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167704647] [2019-11-15 23:37:30,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:37:30,543 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:37:31,241 WARN L191 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-11-15 23:37:31,414 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 23:37:31,418 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:37:31,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:37:31,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:37:31,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:37:31,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:37:31,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:37:31,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:37:31,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:37:31,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18_2.i_Iteration5_Lasso [2019-11-15 23:37:31,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:37:31,419 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:37:31,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,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-11-15 23:37:31,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,662 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 23:37:31,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:31,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:37:32,167 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-11-15 23:37:32,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:37:32,234 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:37:32,235 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-11-15 23:37:32,235 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,235 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,236 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,236 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,237 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-11-15 23:37:32,237 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,238 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,238 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,238 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,238 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,239 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,241 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-11-15 23:37:32,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,244 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-11-15 23:37:32,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,245 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,246 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,247 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-11-15 23:37:32,248 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,248 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,250 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-11-15 23:37:32,251 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,251 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,251 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,252 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,252 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,252 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,252 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,253 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-11-15 23:37:32,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,254 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,254 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,255 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,255 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,257 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-11-15 23:37:32,257 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,257 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,258 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,258 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,258 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,258 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,258 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,259 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-11-15 23:37:32,260 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,260 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,261 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,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-11-15 23:37:32,262 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,262 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,262 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,263 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,263 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,263 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,264 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-11-15 23:37:32,264 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,264 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,265 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,266 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,267 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,267 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-11-15 23:37:32,268 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,269 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,270 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-11-15 23:37:32,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,271 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,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-11-15 23:37:32,273 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,273 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,273 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,273 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,274 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,274 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,275 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,276 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-11-15 23:37:32,276 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,276 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,277 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,278 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,279 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-11-15 23:37:32,280 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,280 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,281 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,281 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,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-11-15 23:37:32,283 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,283 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,283 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,283 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,284 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,284 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,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-11-15 23:37:32,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,287 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-11-15 23:37:32,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,288 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-11-15 23:37:32,288 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,288 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,290 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-11-15 23:37:32,290 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,300 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-11-15 23:37:32,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:37:32,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,301 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,301 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:37:32,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:37:32,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:37:32,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-11-15 23:37:32,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:37:32,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:37:32,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:37:32,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:37:32,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:37:32,305 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:37:32,332 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:37:32,343 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:37:32,344 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:37:32,344 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:37:32,345 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:37:32,345 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:37:32,346 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~j~0) = 2*ULTIMATE.start_entry_point_~j~0 + 1 Supporting invariants [] [2019-11-15 23:37:32,371 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:37:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:32,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:37:32,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:32,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:37:32,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:32,437 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-11-15 23:37:32,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-11-15 23:37:32,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 22 transitions. Complement of second has 4 states. [2019-11-15 23:37:32,452 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-11-15 23:37:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:37:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 23:37:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-15 23:37:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 23:37:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:37:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:37:32,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2019-11-15 23:37:32,454 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:37:32,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-15 23:37:32,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:37:32,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:37:32,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:37:32,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:37:32,455 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:32,455 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:32,455 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:37:32,455 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:37:32,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:37:32,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:37:32,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:37:32,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:37:32 BoogieIcfgContainer [2019-11-15 23:37:32,465 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:37:32,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:37:32,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:37:32,466 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:37:32,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:26" (3/4) ... [2019-11-15 23:37:32,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:37:32,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:37:32,473 INFO L168 Benchmark]: Toolchain (without parser) took 6980.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 937.0 MB in the beginning and 901.6 MB in the end (delta: 35.4 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:32,473 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:32,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:32,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.99 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-11-15 23:37:32,479 INFO L168 Benchmark]: Boogie Preprocessor took 29.70 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-11-15 23:37:32,480 INFO L168 Benchmark]: RCFGBuilder took 396.72 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-11-15 23:37:32,480 INFO L168 Benchmark]: BuchiAutomizer took 5781.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 901.6 MB in the end (delta: 173.4 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:32,480 INFO L168 Benchmark]: Witness Printer took 5.28 ms. Allocated memory is still 1.2 GB. Free memory is still 901.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:32,487 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 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 710.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.99 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 29.70 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. * RCFGBuilder took 396.72 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 5781.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 901.6 MB in the end (delta: 173.4 MB). Peak memory consumption was 226.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.28 ms. Allocated memory is still 1.2 GB. Free memory is still 901.6 MB. 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 85 SDtfs, 59 SDslu, 71 SDs, 0 SdLazy, 59 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn55 mio100 lsp56 div100 bol100 ite100 ukn100 eq190 hnf92 smp100 dnf195 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 225ms VariablesStem: 7 VariablesLoop: 8 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...