./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72845188532fe6d4486465eb4d1c3f34d4b417b7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:43,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:43,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:43,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:43,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:43,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:43,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:43,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:43,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:43,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:43,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:43,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:43,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:43,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:43,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:43,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:43,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:43,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:43,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:43,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:43,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:43,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:43,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:43,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:43,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:43,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:43,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:43,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:43,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:43,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:43,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:43,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:43,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:43,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:43,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:43,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:43,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:43,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:43,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:43,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:43,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:43,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-10-22 11:21:43,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:43,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:43,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:43,825 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:43,825 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:43,826 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:43,826 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:43,826 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:43,826 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:43,826 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:43,827 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:43,827 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:43,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 11:21:43,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 11:21:43,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:43,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:43,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 11:21:43,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:43,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:43,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:43,829 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 11:21:43,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 11:21:43,830 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-10-22 11:21:43,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:43,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:43,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:43,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:43,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:43,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:43,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:43,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:43,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:43,832 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:43,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:43,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:43,833 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan 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(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 72845188532fe6d4486465eb4d1c3f34d4b417b7 [2019-10-22 11:21:43,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:43,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:43,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:43,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:43,887 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:43,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-10-22 11:21:43,949 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/data/64d4f50cf/8d39f102daf24d1c8ddc09228e76be3a/FLAG00d76e900 [2019-10-22 11:21:44,421 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:44,422 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-10-22 11:21:44,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/data/64d4f50cf/8d39f102daf24d1c8ddc09228e76be3a/FLAG00d76e900 [2019-10-22 11:21:44,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/data/64d4f50cf/8d39f102daf24d1c8ddc09228e76be3a [2019-10-22 11:21:44,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:44,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:44,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:44,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:44,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:44,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:44" (1/1) ... [2019-10-22 11:21:44,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1c72df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:44, skipping insertion in model container [2019-10-22 11:21:44,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:44" (1/1) ... [2019-10-22 11:21:44,935 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:44,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:45,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:45,448 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:45,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:45,594 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:45,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45 WrapperNode [2019-10-22 11:21:45,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:45,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:45,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:45,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:45,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:45,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:45,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:45,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:45,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... [2019-10-22 11:21:45,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:45,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:45,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:45,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:45,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:21:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:21:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:46,121 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:46,121 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 11:21:46,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:46 BoogieIcfgContainer [2019-10-22 11:21:46,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:46,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:46,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:46,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:46,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:44" (1/3) ... [2019-10-22 11:21:46,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae95d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:46, skipping insertion in model container [2019-10-22 11:21:46,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:45" (2/3) ... [2019-10-22 11:21:46,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae95d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:46, skipping insertion in model container [2019-10-22 11:21:46,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:46" (3/3) ... [2019-10-22 11:21:46,130 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2019-10-22 11:21:46,137 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:46,145 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-22 11:21:46,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-22 11:21:46,174 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:46,175 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 11:21:46,175 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:46,175 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:46,175 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:46,175 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:46,175 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:46,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-10-22 11:21:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:46,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,200 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 119413611, now seen corresponding path program 1 times [2019-10-22 11:21:46,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816926407] [2019-10-22 11:21:46,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,373 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 11:21:46,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816926407] [2019-10-22 11:21:46,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:46,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208468092] [2019-10-22 11:21:46,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:46,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:46,396 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-10-22 11:21:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,467 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-10-22 11:21:46,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:46,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,477 INFO L225 Difference]: With dead ends: 81 [2019-10-22 11:21:46,477 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 11:21:46,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 11:21:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2019-10-22 11:21:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:21:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-22 11:21:46,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2019-10-22 11:21:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,510 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-22 11:21:46,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-22 11:21:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:46,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,511 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 119443421, now seen corresponding path program 1 times [2019-10-22 11:21:46,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381211134] [2019-10-22 11:21:46,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,554 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 11:21:46,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381211134] [2019-10-22 11:21:46,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:46,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103098740] [2019-10-22 11:21:46,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:46,557 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:46,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:46,557 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-10-22 11:21:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,582 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-22 11:21:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:46,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,583 INFO L225 Difference]: With dead ends: 40 [2019-10-22 11:21:46,583 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:21:46,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:21:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:21:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:21:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-22 11:21:46,587 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-10-22 11:21:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,588 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-22 11:21:46,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-22 11:21:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:46,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,589 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash 176671913, now seen corresponding path program 1 times [2019-10-22 11:21:46,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735438194] [2019-10-22 11:21:46,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,644 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 11:21:46,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735438194] [2019-10-22 11:21:46,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:46,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583143675] [2019-10-22 11:21:46,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:46,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:46,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:46,646 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2019-10-22 11:21:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,759 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-22 11:21:46,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:46,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:46,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,761 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:21:46,761 INFO L226 Difference]: Without dead ends: 52 [2019-10-22 11:21:46,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-22 11:21:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-10-22 11:21:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:21:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-10-22 11:21:46,766 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 8 [2019-10-22 11:21:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,766 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2019-10-22 11:21:46,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2019-10-22 11:21:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:46,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,767 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,768 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:46,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash 176671914, now seen corresponding path program 1 times [2019-10-22 11:21:46,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111742177] [2019-10-22 11:21:46,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,846 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 11:21:46,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111742177] [2019-10-22 11:21:46,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:46,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572091764] [2019-10-22 11:21:46,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:46,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:46,848 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 5 states. [2019-10-22 11:21:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,904 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-10-22 11:21:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:46,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-10-22 11:21:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,905 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:21:46,905 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 11:21:46,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 11:21:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2019-10-22 11:21:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:21:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-10-22 11:21:46,909 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 8 [2019-10-22 11:21:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,910 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-10-22 11:21:46,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-10-22 11:21:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:46,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,911 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,912 INFO L82 PathProgramCache]: Analyzing trace with hash 176672299, now seen corresponding path program 1 times [2019-10-22 11:21:46,912 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526468316] [2019-10-22 11:21:46,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,955 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 11:21:46,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526468316] [2019-10-22 11:21:46,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 11:21:46,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66600677] [2019-10-22 11:21:46,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:46,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:46,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:46,957 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2019-10-22 11:21:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,990 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-10-22 11:21:46,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:46,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-22 11:21:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,991 INFO L225 Difference]: With dead ends: 75 [2019-10-22 11:21:46,991 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 11:21:46,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:46,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 11:21:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-10-22 11:21:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:21:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2019-10-22 11:21:46,998 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 8 [2019-10-22 11:21:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,998 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2019-10-22 11:21:46,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2019-10-22 11:21:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:46,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,000 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash -592221173, now seen corresponding path program 1 times [2019-10-22 11:21:47,001 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512185724] [2019-10-22 11:21:47,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,075 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 11:21:47,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512185724] [2019-10-22 11:21:47,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:47,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977044244] [2019-10-22 11:21:47,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:47,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:47,077 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2019-10-22 11:21:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,147 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-10-22 11:21:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:47,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:21:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,149 INFO L225 Difference]: With dead ends: 75 [2019-10-22 11:21:47,149 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 11:21:47,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 11:21:47,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2019-10-22 11:21:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 11:21:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2019-10-22 11:21:47,154 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 9 [2019-10-22 11:21:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,154 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2019-10-22 11:21:47,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2019-10-22 11:21:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:47,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,155 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1181873979, now seen corresponding path program 1 times [2019-10-22 11:21:47,156 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038273158] [2019-10-22 11:21:47,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,157 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,180 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 11:21:47,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038273158] [2019-10-22 11:21:47,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:47,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321915133] [2019-10-22 11:21:47,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:47,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:47,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:47,181 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand 3 states. [2019-10-22 11:21:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,231 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2019-10-22 11:21:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:47,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:21:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,232 INFO L225 Difference]: With dead ends: 66 [2019-10-22 11:21:47,232 INFO L226 Difference]: Without dead ends: 62 [2019-10-22 11:21:47,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-22 11:21:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2019-10-22 11:21:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:21:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2019-10-22 11:21:47,243 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 9 [2019-10-22 11:21:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,244 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2019-10-22 11:21:47,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2019-10-22 11:21:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:47,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,245 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1182786189, now seen corresponding path program 1 times [2019-10-22 11:21:47,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412049269] [2019-10-22 11:21:47,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,285 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 11:21:47,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412049269] [2019-10-22 11:21:47,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:47,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545752342] [2019-10-22 11:21:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:47,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:47,287 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand 4 states. [2019-10-22 11:21:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,336 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-22 11:21:47,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:47,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:21:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,337 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:21:47,337 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:21:47,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:21:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:21:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:21:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-22 11:21:47,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 9 [2019-10-22 11:21:47,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,341 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-22 11:21:47,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:47,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-22 11:21:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:47,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,342 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1178987105, now seen corresponding path program 1 times [2019-10-22 11:21:47,343 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95559271] [2019-10-22 11:21:47,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,346 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,386 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 11:21:47,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95559271] [2019-10-22 11:21:47,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:47,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033915921] [2019-10-22 11:21:47,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:47,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:47,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:47,388 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 4 states. [2019-10-22 11:21:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,443 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-22 11:21:47,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:47,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:21:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,444 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:21:47,444 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:21:47,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:21:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:21:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:21:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-22 11:21:47,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 10 [2019-10-22 11:21:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,447 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-22 11:21:47,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-22 11:21:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:47,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,449 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944307, now seen corresponding path program 1 times [2019-10-22 11:21:47,449 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344940893] [2019-10-22 11:21:47,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,502 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 11:21:47,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344940893] [2019-10-22 11:21:47,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:47,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585913140] [2019-10-22 11:21:47,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:47,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:47,504 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 4 states. [2019-10-22 11:21:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,565 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-22 11:21:47,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:47,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:21:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,566 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:21:47,566 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:21:47,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:21:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 11:21:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:21:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-22 11:21:47,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 10 [2019-10-22 11:21:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,570 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-22 11:21:47,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-22 11:21:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:47,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,571 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1178944306, now seen corresponding path program 1 times [2019-10-22 11:21:47,575 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220614504] [2019-10-22 11:21:47,575 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,677 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 11:21:47,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220614504] [2019-10-22 11:21:47,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:47,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889290873] [2019-10-22 11:21:47,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:47,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,680 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2019-10-22 11:21:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,761 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-10-22 11:21:47,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:47,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 11:21:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,762 INFO L225 Difference]: With dead ends: 32 [2019-10-22 11:21:47,762 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:21:47,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:21:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-22 11:21:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:21:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-22 11:21:47,765 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 10 [2019-10-22 11:21:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,765 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-22 11:21:47,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-22 11:21:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:47,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,766 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,767 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1037777200, now seen corresponding path program 1 times [2019-10-22 11:21:47,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80837999] [2019-10-22 11:21:47,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,826 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 11:21:47,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80837999] [2019-10-22 11:21:47,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:47,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797487439] [2019-10-22 11:21:47,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:47,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:47,828 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2019-10-22 11:21:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,867 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-10-22 11:21:47,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:47,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-22 11:21:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,869 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:21:47,869 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:21:47,869 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:21:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2019-10-22 11:21:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:21:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-22 11:21:47,872 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 13 [2019-10-22 11:21:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,872 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-22 11:21:47,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-22 11:21:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:47,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:47,873 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:47,873 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1037777585, now seen corresponding path program 1 times [2019-10-22 11:21:47,874 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:47,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043816913] [2019-10-22 11:21:47,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:47,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:47,955 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 11:21:47,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043816913] [2019-10-22 11:21:47,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:47,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:47,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763117360] [2019-10-22 11:21:47,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:47,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:47,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:47,957 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 6 states. [2019-10-22 11:21:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,078 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-10-22 11:21:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:48,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:21:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,079 INFO L225 Difference]: With dead ends: 38 [2019-10-22 11:21:48,079 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:21:48,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:21:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-22 11:21:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:21:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-22 11:21:48,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 13 [2019-10-22 11:21:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,082 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-22 11:21:48,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-22 11:21:48,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:21:48,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,087 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,087 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1037777586, now seen corresponding path program 1 times [2019-10-22 11:21:48,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245294085] [2019-10-22 11:21:48,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,142 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 11:21:48,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245294085] [2019-10-22 11:21:48,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:48,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39080263] [2019-10-22 11:21:48,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:48,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:48,145 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2019-10-22 11:21:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,169 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-22 11:21:48,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:48,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:21:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,170 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:21:48,170 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:21:48,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:21:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:21:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:21:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-22 11:21:48,177 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 13 [2019-10-22 11:21:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,177 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-22 11:21:48,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-22 11:21:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:21:48,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,178 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,178 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2106334100, now seen corresponding path program 1 times [2019-10-22 11:21:48,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306430619] [2019-10-22 11:21:48,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,256 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 11:21:48,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306430619] [2019-10-22 11:21:48,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:48,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125498349] [2019-10-22 11:21:48,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:48,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:48,258 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 5 states. [2019-10-22 11:21:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,331 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-10-22 11:21:48,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:48,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:21:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,332 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:21:48,332 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 11:21:48,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 11:21:48,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-22 11:21:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 11:21:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2019-10-22 11:21:48,334 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 14 [2019-10-22 11:21:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,334 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2019-10-22 11:21:48,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2019-10-22 11:21:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:48,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,341 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2072222585, now seen corresponding path program 1 times [2019-10-22 11:21:48,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559127503] [2019-10-22 11:21:48,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,437 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 11:21:48,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559127503] [2019-10-22 11:21:48,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:48,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003749532] [2019-10-22 11:21:48,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:48,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:48,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:48,439 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 9 states. [2019-10-22 11:21:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,596 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-10-22 11:21:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:48,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-10-22 11:21:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,597 INFO L225 Difference]: With dead ends: 27 [2019-10-22 11:21:48,597 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:21:48,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:21:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:21:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:21:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-10-22 11:21:48,599 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 16 [2019-10-22 11:21:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,600 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-10-22 11:21:48,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-10-22 11:21:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:21:48,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,601 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2072222586, now seen corresponding path program 1 times [2019-10-22 11:21:48,601 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174085751] [2019-10-22 11:21:48,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,669 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 11:21:48,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174085751] [2019-10-22 11:21:48,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:48,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773718280] [2019-10-22 11:21:48,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:48,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:48,670 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 6 states. [2019-10-22 11:21:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,726 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-10-22 11:21:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:48,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:21:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,727 INFO L225 Difference]: With dead ends: 26 [2019-10-22 11:21:48,727 INFO L226 Difference]: Without dead ends: 26 [2019-10-22 11:21:48,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-22 11:21:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-22 11:21:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:21:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-10-22 11:21:48,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 16 [2019-10-22 11:21:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,729 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-10-22 11:21:48,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-10-22 11:21:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:21:48,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,730 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash -185609283, now seen corresponding path program 1 times [2019-10-22 11:21:48,731 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567252702] [2019-10-22 11:21:48,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,819 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 11:21:48,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567252702] [2019-10-22 11:21:48,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:48,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916850170] [2019-10-22 11:21:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:48,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:48,821 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 8 states. [2019-10-22 11:21:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:48,922 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2019-10-22 11:21:48,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:48,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-22 11:21:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:48,923 INFO L225 Difference]: With dead ends: 25 [2019-10-22 11:21:48,923 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:21:48,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:21:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-22 11:21:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 11:21:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2019-10-22 11:21:48,925 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 17 [2019-10-22 11:21:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2019-10-22 11:21:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2019-10-22 11:21:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:21:48,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:48,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:48,926 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1458920391, now seen corresponding path program 1 times [2019-10-22 11:21:48,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:48,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169196571] [2019-10-22 11:21:48,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:48,996 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 11:21:48,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169196571] [2019-10-22 11:21:48,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:48,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:48,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220427902] [2019-10-22 11:21:48,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:48,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:48,997 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 8 states. [2019-10-22 11:21:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:49,107 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-10-22 11:21:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:49,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-10-22 11:21:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:49,108 INFO L225 Difference]: With dead ends: 24 [2019-10-22 11:21:49,108 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:21:49,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:21:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:21:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:21:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-10-22 11:21:49,110 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 18 [2019-10-22 11:21:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:49,110 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-10-22 11:21:49,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-10-22 11:21:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:21:49,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:49,112 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:49,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE]=== [2019-10-22 11:21:49,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:49,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2018108223, now seen corresponding path program 1 times [2019-10-22 11:21:49,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:49,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061901109] [2019-10-22 11:21:49,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:49,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:49,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:49,162 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:49,162 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:49,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:49 BoogieIcfgContainer [2019-10-22 11:21:49,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:49,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:49,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:49,193 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:49,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:46" (3/4) ... [2019-10-22 11:21:49,196 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:49,241 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_531abf85-ca7e-47df-9efd-f68969abeaf3/bin/utaipan/witness.graphml [2019-10-22 11:21:49,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:49,243 INFO L168 Benchmark]: Toolchain (without parser) took 4324.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 937.8 MB in the beginning and 981.3 MB in the end (delta: -43.4 MB). Peak memory consumption was 87.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:49,243 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:49,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:49,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.69 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 11:21:49,244 INFO L168 Benchmark]: Boogie Preprocessor took 42.28 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 11:21:49,245 INFO L168 Benchmark]: RCFGBuilder took 431.95 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.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:49,245 INFO L168 Benchmark]: TraceAbstraction took 3069.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:49,245 INFO L168 Benchmark]: Witness Printer took 48.03 ms. Allocated memory is still 1.2 GB. Free memory was 988.2 MB in the beginning and 981.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:49,247 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.69 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 42.28 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 431.95 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.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3069.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. * Witness Printer took 48.03 ms. Allocated memory is still 1.2 GB. Free memory was 988.2 MB in the beginning and 981.3 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 783]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L785] struct A a6; VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L765] int ret = - -3; [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L766] int *p = (int *)ldv_malloc(sizeof(int)); [L767] COND FALSE !(p==0) [L759] return __VERIFIER_nondet_int(); [L769] ret = f6() [L770] COND FALSE !(ret<0) [L762] return __VERIFIER_nondet_int(); [L772] ret = g6() [L773] COND FALSE !(ret<0) VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L775] a->p = p VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L776] free(p) VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L776] free(p) VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L776] free(p) [L777] return 0; VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L787] int ret = probe3_6(&a6); [L788] COND TRUE ret==0 [L783] EXPR a->p VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L783] free(a->p) VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L783] free(a->p) VAL [a6={12:0}, ldv_global_msg_list={11:0}] [L783] free(a->p) VAL [a6={12:0}, ldv_global_msg_list={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 16 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 566 SDtfs, 910 SDslu, 566 SDs, 0 SdLazy, 509 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 86 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 15168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...