./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/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 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:04,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:04,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:04,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:04,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:04,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:04,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:04,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:04,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:04,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:04,642 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:04,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:04,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:04,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:04,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:04,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:04,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:04,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:04,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:04,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:04,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:04,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:04,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:04,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:04,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:04,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:04,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:04,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:04,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:04,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:04,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:04,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:04,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:04,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:04,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:04,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:04,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:04,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:04,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:04,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:04,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:04,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:04,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:04,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:04,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:04,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:04,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:04,694 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:04,694 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:04,694 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:04,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:04,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:04,696 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:04,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:04,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:04,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:04,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:04,697 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:04,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:04,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:04,698 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:04,699 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:04,699 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/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 -> 3c7f8519a8c276dd62400de22bd8a8ed2f8e4176 [2019-10-22 09:02:04,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:04,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:04,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:04,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:04,737 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:04,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-10-22 09:02:04,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/data/b8d10d5d3/bf04e46b9b394753a08c39350078ea1f/FLAG7c7f14b36 [2019-10-22 09:02:05,301 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:05,302 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/sv-benchmarks/c/ldv-memsafety/memleaks_test18.i [2019-10-22 09:02:05,317 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/data/b8d10d5d3/bf04e46b9b394753a08c39350078ea1f/FLAG7c7f14b36 [2019-10-22 09:02:05,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/data/b8d10d5d3/bf04e46b9b394753a08c39350078ea1f [2019-10-22 09:02:05,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:05,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:05,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:05,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:05,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:05,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:05" (1/1) ... [2019-10-22 09:02:05,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f4a186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:05, skipping insertion in model container [2019-10-22 09:02:05,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:05" (1/1) ... [2019-10-22 09:02:05,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:05,824 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:06,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:06,231 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:06,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:06,370 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:06,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06 WrapperNode [2019-10-22 09:02:06,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:06,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:06,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:06,371 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:06,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:06,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:06,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:06,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:06,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... [2019-10-22 09:02:06,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:06,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:06,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:06,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:06,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:02:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:02:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:02:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 09:02:06,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:06,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:06,715 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:06,716 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-10-22 09:02:06,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:06 BoogieIcfgContainer [2019-10-22 09:02:06,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:06,717 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:06,719 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:06,722 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:06,723 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:06,723 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:05" (1/3) ... [2019-10-22 09:02:06,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5170fd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:06, skipping insertion in model container [2019-10-22 09:02:06,724 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:06,724 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:06" (2/3) ... [2019-10-22 09:02:06,724 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5170fd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:06, skipping insertion in model container [2019-10-22 09:02:06,725 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:06,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:06" (3/3) ... [2019-10-22 09:02:06,726 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test18.i [2019-10-22 09:02:06,764 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:06,764 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:06,764 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:06,764 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:06,764 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:06,764 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:06,764 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:06,764 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:06,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:06,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:02:06,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:06,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:06,799 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:06,799 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:06,799 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:06,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2019-10-22 09:02:06,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:02:06,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:06,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:06,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:06,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:06,806 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 8#L-1true havoc entry_point_#t~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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 12#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; 13#L764true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 11#L768-3true [2019-10-22 09:02:06,806 INFO L793 eck$LassoCheckResult]: Loop: 11#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; 15#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; 7#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); 9#L768-2true entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 11#L768-3true [2019-10-22 09:02:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2019-10-22 09:02:06,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559240354] [2019-10-22 09:02:06,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:06,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559240354] [2019-10-22 09:02:06,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:06,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:06,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046300108] [2019-10-22 09:02:06,967 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:06,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:06,968 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 1 times [2019-10-22 09:02:06,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:06,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112870937] [2019-10-22 09:02:06,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:06,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,011 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:07,238 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 09:02:07,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:07,335 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-10-22 09:02:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:07,393 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-22 09:02:07,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:07,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 09:02:07,397 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-10-22 09:02:07,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 20 states and 25 transitions. [2019-10-22 09:02:07,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:02:07,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:02:07,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-10-22 09:02:07,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:07,403 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-22 09:02:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-10-22 09:02:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2019-10-22 09:02:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 09:02:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-10-22 09:02:07,428 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 09:02:07,428 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-10-22 09:02:07,428 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:07,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-10-22 09:02:07,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-10-22 09:02:07,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:07,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:07,429 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:07,429 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:07,430 INFO L791 eck$LassoCheckResult]: Stem: 70#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); 67#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 68#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; 71#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; 72#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 69#L768-3 [2019-10-22 09:02:07,430 INFO L793 eck$LassoCheckResult]: Loop: 69#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); 65#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 69#L768-3 [2019-10-22 09:02:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2019-10-22 09:02:07,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:07,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267177413] [2019-10-22 09:02:07,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,469 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 47811737, now seen corresponding path program 2 times [2019-10-22 09:02:07,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:07,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673339350] [2019-10-22 09:02:07,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,495 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1232444971, now seen corresponding path program 1 times [2019-10-22 09:02:07,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:07,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20666898] [2019-10-22 09:02:07,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:07,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:07,573 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:07,726 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 09:02:07,995 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-10-22 09:02:08,099 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:08,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:08,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:08,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:08,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:08,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:08,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:08,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:08,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration2_Lasso [2019-10-22 09:02:08,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:08,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:08,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,366 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-10-22 09:02:08,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,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-10-22 09:02:08,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-10-22 09:02:08,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:08,982 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-10-22 09:02:09,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:09,180 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:09,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,193 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:09,193 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:09,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,201 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:09,201 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,201 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,202 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:09,202 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:09,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,203 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:09,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,204 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,204 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,204 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:09,205 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:09,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,215 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,215 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,215 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,216 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,217 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:09,217 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:09,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,231 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,231 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,233 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:09,233 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:09,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:09,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,254 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:09,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:09,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,264 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:09,265 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:09,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,278 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:09,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:09,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:09,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,285 INFO L202 nArgumentSynthesizer]: 3 stem disjuncts [2019-10-22 09:02:09,285 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:02:09,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,315 INFO L400 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2019-10-22 09:02:09,315 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 09:02:09,468 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:09,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:09,469 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:09,469 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:09,470 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:09,470 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:09,475 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:09,475 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:09,518 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:09,605 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:02:09,605 INFO L444 ModelExtractionUtils]: 35 out of 43 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:02:09,607 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:09,609 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:09,609 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:09,610 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-10-22 09:02:09,631 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:02:09,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:09,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:09,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:09,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 09:02:09,775 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 6 states. [2019-10-22 09:02:09,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 09:02:09,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 09:02:09,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:09,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 09:02:09,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:09,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 09:02:09,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:09,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 09:02:09,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:02:09,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 20 states and 26 transitions. [2019-10-22 09:02:09,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:02:09,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:02:09,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-10-22 09:02:09,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:09,784 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-10-22 09:02:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-10-22 09:02:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-10-22 09:02:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 09:02:09,785 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:02:09,785 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:02:09,786 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:09,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-10-22 09:02:09,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:09,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,787 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:09,788 INFO L791 eck$LassoCheckResult]: Stem: 186#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); 183#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 184#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; 188#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; 189#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 187#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 180#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 174#L774-3 [2019-10-22 09:02:09,788 INFO L793 eck$LassoCheckResult]: Loop: 174#L774-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; 173#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 174#L774-3 [2019-10-22 09:02:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1804966489, now seen corresponding path program 1 times [2019-10-22 09:02:09,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225703136] [2019-10-22 09:02:09,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225703136] [2019-10-22 09:02:09,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:09,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217580342] [2019-10-22 09:02:09,818 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-10-22 09:02:09,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732934907] [2019-10-22 09:02:09,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:09,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:09,857 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 09:02:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,876 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-10-22 09:02:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:09,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2019-10-22 09:02:09,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:02:09,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 34 transitions. [2019-10-22 09:02:09,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:02:09,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:02:09,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-10-22 09:02:09,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:09,879 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:02:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-10-22 09:02:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-10-22 09:02:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-10-22 09:02:09,881 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 09:02:09,881 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-10-22 09:02:09,881 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:09,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2019-10-22 09:02:09,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:09,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:09,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:09,883 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,883 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:09,883 INFO L791 eck$LassoCheckResult]: Stem: 237#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); 234#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 235#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; 239#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; 240#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 238#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; 226#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 227#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; 230#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 231#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 225#L774-3 [2019-10-22 09:02:09,883 INFO L793 eck$LassoCheckResult]: Loop: 225#L774-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; 224#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 225#L774-3 [2019-10-22 09:02:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1232385447, now seen corresponding path program 1 times [2019-10-22 09:02:09,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599205197] [2019-10-22 09:02:09,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 2 times [2019-10-22 09:02:09,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828644464] [2019-10-22 09:02:09,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:09,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1088560603, now seen corresponding path program 1 times [2019-10-22 09:02:09,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271549118] [2019-10-22 09:02:09,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271549118] [2019-10-22 09:02:09,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:09,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803670410] [2019-10-22 09:02:09,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:09,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:09,980 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:02:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,019 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-10-22 09:02:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:10,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2019-10-22 09:02:10,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:10,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 26 transitions. [2019-10-22 09:02:10,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 09:02:10,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 09:02:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-10-22 09:02:10,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:10,022 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-10-22 09:02:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-10-22 09:02:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-10-22 09:02:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-22 09:02:10,024 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 09:02:10,024 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-22 09:02:10,024 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:02:10,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2019-10-22 09:02:10,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:10,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:10,030 INFO L791 eck$LassoCheckResult]: Stem: 291#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); 288#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 289#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; 293#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; 294#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 292#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; 282#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 283#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; 286#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); 287#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 290#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 285#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 279#L774-3 [2019-10-22 09:02:10,030 INFO L793 eck$LassoCheckResult]: Loop: 279#L774-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; 278#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 279#L774-3 [2019-10-22 09:02:10,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1088615463, now seen corresponding path program 1 times [2019-10-22 09:02:10,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700933990] [2019-10-22 09:02:10,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700933990] [2019-10-22 09:02:10,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:10,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251564426] [2019-10-22 09:02:10,060 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 3 times [2019-10-22 09:02:10,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636815338] [2019-10-22 09:02:10,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:10,095 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-10-22 09:02:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,123 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-22 09:02:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:10,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2019-10-22 09:02:10,125 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 09:02:10,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 28 transitions. [2019-10-22 09:02:10,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 09:02:10,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:02:10,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2019-10-22 09:02:10,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:10,126 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-22 09:02:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2019-10-22 09:02:10,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-10-22 09:02:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:02:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-10-22 09:02:10,128 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 09:02:10,128 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-10-22 09:02:10,128 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:02:10,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-10-22 09:02:10,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:10,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,130 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,130 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:10,130 INFO L791 eck$LassoCheckResult]: Stem: 344#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); 341#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 342#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; 346#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; 347#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 345#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; 335#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; 336#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; 339#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); 340#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 343#L768-3 assume !(entry_point_~i~0 < entry_point_~len~0); 338#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 332#L774-3 [2019-10-22 09:02:10,131 INFO L793 eck$LassoCheckResult]: Loop: 332#L774-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; 331#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 332#L774-3 [2019-10-22 09:02:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1031357161, now seen corresponding path program 1 times [2019-10-22 09:02:10,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737251301] [2019-10-22 09:02:10,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737251301] [2019-10-22 09:02:10,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418179103] [2019-10-22 09:02:10,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8fe5185-7c32-48ba-b1f0-c3c3cff32806/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:10,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,273 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:10,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-10-22 09:02:10,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118655985] [2019-10-22 09:02:10,274 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:10,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 4 times [2019-10-22 09:02:10,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346447915] [2019-10-22 09:02:10,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:02:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:10,312 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 09:02:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,351 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2019-10-22 09:02:10,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:10,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 09:02:10,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:02:10,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2019-10-22 09:02:10,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:02:10,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:02:10,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2019-10-22 09:02:10,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:10,354 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-22 09:02:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2019-10-22 09:02:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-10-22 09:02:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 09:02:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-22 09:02:10,356 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-22 09:02:10,356 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-22 09:02:10,356 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:02:10,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-10-22 09:02:10,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:02:10,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:10,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:10,357 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,357 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:02:10,357 INFO L791 eck$LassoCheckResult]: Stem: 436#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); 433#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_~p~0.base, entry_point_~p~0.offset, entry_point_~i~0, entry_point_~j~0, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;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; 434#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; 440#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; 441#L764 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;havoc entry_point_~p~0.base, entry_point_~p~0.offset;entry_point_~i~0 := 0;havoc entry_point_~j~0; 437#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; 438#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; 444#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; 443#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); 442#L768-2 entry_point_#t~post39 := entry_point_~i~0;entry_point_~i~0 := 1 + entry_point_#t~post39;havoc entry_point_#t~post39; 439#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; 425#L527-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 426#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; 429#L770 assume entry_point_~p~0.base == 0 && entry_point_~p~0.offset == 0; 430#L773 entry_point_~j~0 := entry_point_~i~0 - 1; 424#L774-3 [2019-10-22 09:02:10,357 INFO L793 eck$LassoCheckResult]: Loop: 424#L774-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; 423#L774-2 entry_point_#t~post41 := entry_point_~j~0;entry_point_~j~0 := entry_point_#t~post41 - 1;havoc entry_point_#t~post41; 424#L774-3 [2019-10-22 09:02:10,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1033365559, now seen corresponding path program 1 times [2019-10-22 09:02:10,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369716726] [2019-10-22 09:02:10,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 5 times [2019-10-22 09:02:10,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047433438] [2019-10-22 09:02:10,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,398 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,401 INFO L82 PathProgramCache]: Analyzing trace with hash -926855349, now seen corresponding path program 1 times [2019-10-22 09:02:10,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401455785] [2019-10-22 09:02:10,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:10,430 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:10,937 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 145 [2019-10-22 09:02:11,054 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-10-22 09:02:11,060 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:11,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:11,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:11,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:11,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:11,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:11,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:11,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:11,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test18.i_Iteration7_Lasso [2019-10-22 09:02:11,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:11,062 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:11,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,340 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-22 09:02:11,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:11,751 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-10-22 09:02:11,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:11,829 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:11,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,831 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,831 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,834 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,834 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,835 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,835 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,835 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,838 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,838 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,841 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,843 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,846 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,846 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,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-10-22 09:02:11,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,849 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,849 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,849 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,851 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,873 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,873 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,875 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,881 INFO L202 nArgumentSynthesizer]: 5 stem disjuncts [2019-10-22 09:02:11,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,884 INFO L400 nArgumentSynthesizer]: We have 14 Motzkin's Theorem applications. [2019-10-22 09:02:11,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,895 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,895 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,895 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,896 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,896 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,907 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,907 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,908 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,910 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,911 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,911 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,911 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,912 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,913 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,913 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,923 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,924 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,924 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,928 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,928 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,928 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,931 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:11,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,933 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,933 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:11,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:11,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,935 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,936 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:11,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:11,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:11,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:11,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:11,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:11,940 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:11,940 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:11,951 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:11,959 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:02:11,959 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:02:11,960 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:11,961 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:11,961 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:11,961 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-10-22 09:02:11,990 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-10-22 09:02:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:12,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:12,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:12,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,050 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:12,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 09:02:12,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2019-10-22 09:02:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:12,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:02:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:02:12,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-10-22 09:02:12,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:12,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-10-22 09:02:12,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:12,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:02:12,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:12,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-10-22 09:02:12,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:12,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-10-22 09:02:12,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:12,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:12,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:12,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:12,068 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:12,068 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:12,068 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:12,068 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:02:12,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:12,069 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:12,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:12,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:12 BoogieIcfgContainer [2019-10-22 09:02:12,077 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:12,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:12,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:12,078 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:12,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:06" (3/4) ... [2019-10-22 09:02:12,084 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:12,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:12,085 INFO L168 Benchmark]: Toolchain (without parser) took 6325.20 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.8 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -228.9 MB). Peak memory consumption was 100.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:12,085 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:12,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:12,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:12,086 INFO L168 Benchmark]: Boogie Preprocessor took 32.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:12,087 INFO L168 Benchmark]: RCFGBuilder took 266.93 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:12,087 INFO L168 Benchmark]: BuchiAutomizer took 5360.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:12,088 INFO L168 Benchmark]: Witness Printer took 6.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:12,092 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.09 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 32.49 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 266.93 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: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5360.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.3 MB). Peak memory consumption was 93.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 115 SDtfs, 128 SDslu, 119 SDs, 0 SdLazy, 98 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital256 mio100 ax111 hnf101 lsp83 ukn56 mio100 lsp57 div100 bol100 ite100 ukn100 eq191 hnf90 smp100 dnf190 smp66 tf100 neg94 sie124 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 183ms 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...