./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/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 cb3a1029b311511a929aa1b20bb93012329001e7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 12:50:05,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:50:05,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:50:05,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:50:05,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:50:05,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:50:05,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:50:05,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:50:05,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:50:05,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:50:05,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:50:05,867 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:50:05,867 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:50:05,868 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:50:05,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:50:05,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:50:05,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:50:05,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:50:05,871 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:50:05,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:50:05,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:50:05,873 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:50:05,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:50:05,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:50:05,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:50:05,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:50:05,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:50:05,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:50:05,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:50:05,876 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:50:05,876 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:50:05,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:50:05,877 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:50:05,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:50:05,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:50:05,878 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:50:05,878 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 12:50:05,885 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:50:05,885 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:50:05,886 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:50:05,886 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:50:05,886 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:50:05,886 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:50:05,886 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:50:05,886 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:50:05,887 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:50:05,887 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:50:05,887 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:50:05,887 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:50:05,887 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:50:05,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 12:50:05,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:50:05,888 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:50:05,889 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:50:05,889 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:50:05,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:50:05,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:50:05,890 INFO L133 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_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/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 -> cb3a1029b311511a929aa1b20bb93012329001e7 [2018-12-09 12:50:05,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:50:05,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:50:05,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:50:05,918 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:50:05,919 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:50:05,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/../../sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-12-09 12:50:05,954 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/data/27dfd85fc/2cac5107ed974f2aa3383af49a011354/FLAG5ecc90f30 [2018-12-09 12:50:06,289 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:50:06,289 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/sv-benchmarks/c/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-12-09 12:50:06,295 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/data/27dfd85fc/2cac5107ed974f2aa3383af49a011354/FLAG5ecc90f30 [2018-12-09 12:50:06,684 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/data/27dfd85fc/2cac5107ed974f2aa3383af49a011354 [2018-12-09 12:50:06,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:50:06,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:50:06,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:50:06,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:50:06,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:50:06,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0ff27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06, skipping insertion in model container [2018-12-09 12:50:06,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:50:06,713 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:50:06,848 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:50:06,853 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:50:06,908 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:50:06,928 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:50:06,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06 WrapperNode [2018-12-09 12:50:06,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:50:06,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:50:06,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:50:06,928 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:50:06,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:50:06,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:50:06,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:50:06,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:50:06,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... [2018-12-09 12:50:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:50:06,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:50:06,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:50:06,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:50:06,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/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 [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 12:50:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 12:50:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2018-12-09 12:50:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:50:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2018-12-09 12:50:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2018-12-09 12:50:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:50:06,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:50:07,155 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:50:07,155 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 12:50:07,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:07 BoogieIcfgContainer [2018-12-09 12:50:07,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:50:07,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:50:07,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:50:07,158 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:50:07,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:50:06" (1/3) ... [2018-12-09 12:50:07,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c55cdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:50:07, skipping insertion in model container [2018-12-09 12:50:07,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:50:06" (2/3) ... [2018-12-09 12:50:07,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c55cdce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:50:07, skipping insertion in model container [2018-12-09 12:50:07,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:07" (3/3) ... [2018-12-09 12:50:07,160 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-12-09 12:50:07,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:50:07,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 12:50:07,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 12:50:07,201 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:50:07,201 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 12:50:07,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:50:07,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:50:07,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:50:07,202 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:50:07,202 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:50:07,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:50:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-12-09 12:50:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 12:50:07,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,222 INFO L82 PathProgramCache]: Analyzing trace with hash -795744594, now seen corresponding path program 1 times [2018-12-09 12:50:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:50:07,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:50:07,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:50:07,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:50:07,346 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 5 states. [2018-12-09 12:50:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:07,442 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-09 12:50:07,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:50:07,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 12:50:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:07,451 INFO L225 Difference]: With dead ends: 52 [2018-12-09 12:50:07,451 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 12:50:07,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:50:07,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 12:50:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-09 12:50:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 12:50:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-09 12:50:07,475 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2018-12-09 12:50:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:07,475 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-09 12:50:07,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:50:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-09 12:50:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 12:50:07,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -795744593, now seen corresponding path program 1 times [2018-12-09 12:50:07,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:50:07,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:50:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:50:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:50:07,533 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2018-12-09 12:50:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:07,612 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-09 12:50:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:50:07,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 12:50:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:07,613 INFO L225 Difference]: With dead ends: 46 [2018-12-09 12:50:07,613 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 12:50:07,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:50:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 12:50:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 12:50:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 12:50:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-09 12:50:07,617 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 9 [2018-12-09 12:50:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:07,617 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-09 12:50:07,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:50:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-09 12:50:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 12:50:07,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,618 INFO L82 PathProgramCache]: Analyzing trace with hash -206376432, now seen corresponding path program 1 times [2018-12-09 12:50:07,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:50:07,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:50:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:50:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:50:07,672 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 7 states. [2018-12-09 12:50:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:07,730 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-09 12:50:07,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:50:07,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-09 12:50:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:07,731 INFO L225 Difference]: With dead ends: 45 [2018-12-09 12:50:07,731 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 12:50:07,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:50:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 12:50:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 12:50:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 12:50:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-09 12:50:07,734 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 11 [2018-12-09 12:50:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:07,734 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-09 12:50:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:50:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-09 12:50:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:50:07,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,735 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -94696213, now seen corresponding path program 1 times [2018-12-09 12:50:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:50:07,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:50:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:50:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:50:07,765 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 3 states. [2018-12-09 12:50:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:07,783 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-09 12:50:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:50:07,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 12:50:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:07,784 INFO L225 Difference]: With dead ends: 41 [2018-12-09 12:50:07,784 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 12:50:07,784 INFO L631 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 [2018-12-09 12:50:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 12:50:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 12:50:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 12:50:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-09 12:50:07,786 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2018-12-09 12:50:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:07,786 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-09 12:50:07,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:50:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-09 12:50:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 12:50:07,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -94696212, now seen corresponding path program 1 times [2018-12-09 12:50:07,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 12:50:07,812 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:50:07,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:50:07,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:50:07,812 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 3 states. [2018-12-09 12:50:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:07,828 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-09 12:50:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:50:07,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 12:50:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:07,829 INFO L225 Difference]: With dead ends: 37 [2018-12-09 12:50:07,829 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 12:50:07,829 INFO L631 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 [2018-12-09 12:50:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 12:50:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-09 12:50:07,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 12:50:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-09 12:50:07,831 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 18 [2018-12-09 12:50:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:07,831 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-09 12:50:07,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:50:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-09 12:50:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 12:50:07,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:07,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:07,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:07,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1467346565, now seen corresponding path program 1 times [2018-12-09 12:50:07,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:07,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:07,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:07,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:50:07,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:07,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 12:50:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 12:50:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:50:07,936 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-12-09 12:50:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:08,056 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-09 12:50:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 12:50:08,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-12-09 12:50:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:08,057 INFO L225 Difference]: With dead ends: 36 [2018-12-09 12:50:08,057 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 12:50:08,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:50:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 12:50:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 12:50:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 12:50:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-09 12:50:08,061 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2018-12-09 12:50:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:08,061 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-09 12:50:08,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 12:50:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-09 12:50:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 12:50:08,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:08,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:08,062 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:08,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1756896819, now seen corresponding path program 1 times [2018-12-09 12:50:08,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:08,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:08,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:08,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:08,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:50:08,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:08,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:50:08,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:50:08,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:50:08,212 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-12-09 12:50:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:08,377 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-09 12:50:08,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 12:50:08,377 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-09 12:50:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:08,377 INFO L225 Difference]: With dead ends: 35 [2018-12-09 12:50:08,377 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 12:50:08,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:50:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 12:50:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-09 12:50:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 12:50:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-09 12:50:08,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 26 [2018-12-09 12:50:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:08,380 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-09 12:50:08,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:50:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-09 12:50:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 12:50:08,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:08,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:08,381 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1370773379, now seen corresponding path program 1 times [2018-12-09 12:50:08,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:08,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:08,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:08,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:08,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 12:50:08,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:08,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 12:50:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 12:50:08,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:50:08,555 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 12 states. [2018-12-09 12:50:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:08,660 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-09 12:50:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 12:50:08,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-09 12:50:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:08,661 INFO L225 Difference]: With dead ends: 34 [2018-12-09 12:50:08,661 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 12:50:08,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-12-09 12:50:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 12:50:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 12:50:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 12:50:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-09 12:50:08,664 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 27 [2018-12-09 12:50:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:08,665 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-09 12:50:08,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 12:50:08,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-09 12:50:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 12:50:08,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:08,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:08,666 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:08,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 454994651, now seen corresponding path program 1 times [2018-12-09 12:50:08,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:08,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:08,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:08,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:08,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 12:50:08,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:08,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 12:50:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 12:50:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-12-09 12:50:08,865 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 17 states. [2018-12-09 12:50:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:09,096 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-12-09 12:50:09,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 12:50:09,096 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-12-09 12:50:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:09,096 INFO L225 Difference]: With dead ends: 36 [2018-12-09 12:50:09,096 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 12:50:09,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-12-09 12:50:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 12:50:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-09 12:50:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 12:50:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2018-12-09 12:50:09,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 28 [2018-12-09 12:50:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:09,099 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2018-12-09 12:50:09,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 12:50:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2018-12-09 12:50:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 12:50:09,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:09,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:09,099 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:09,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash 455698293, now seen corresponding path program 1 times [2018-12-09 12:50:09,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:09,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:09,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:09,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-09 12:50:09,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:09,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 12:50:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 12:50:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-12-09 12:50:09,373 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 20 states. [2018-12-09 12:50:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:09,838 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-12-09 12:50:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 12:50:09,838 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2018-12-09 12:50:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:09,839 INFO L225 Difference]: With dead ends: 33 [2018-12-09 12:50:09,839 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 12:50:09,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 12:50:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 12:50:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 12:50:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 12:50:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-12-09 12:50:09,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 28 [2018-12-09 12:50:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:09,841 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-12-09 12:50:09,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 12:50:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-12-09 12:50:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 12:50:09,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:50:09,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:50:09,841 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION]=== [2018-12-09 12:50:09,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:50:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash 280345312, now seen corresponding path program 1 times [2018-12-09 12:50:09,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:50:09,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:09,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:50:09,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:50:09,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:50:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:50:10,553 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 30 [2018-12-09 12:50:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:50:11,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:50:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-12-09 12:50:11,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:50:11,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 12:50:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 12:50:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-12-09 12:50:11,371 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 23 states. [2018-12-09 12:50:11,860 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2018-12-09 12:50:12,229 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-09 12:50:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:50:12,644 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-12-09 12:50:12,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 12:50:12,644 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-12-09 12:50:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:50:12,645 INFO L225 Difference]: With dead ends: 32 [2018-12-09 12:50:12,645 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 12:50:12,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 12:50:12,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 12:50:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 12:50:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 12:50:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 12:50:12,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-12-09 12:50:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:50:12,647 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 12:50:12,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 12:50:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 12:50:12,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 12:50:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:50:12 BoogieIcfgContainer [2018-12-09 12:50:12,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:50:12,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:50:12,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:50:12,655 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:50:12,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:50:07" (3/4) ... [2018-12-09 12:50:12,660 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 12:50:12,667 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 12:50:12,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 12:50:12,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2018-12-09 12:50:12,668 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2018-12-09 12:50:12,672 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-09 12:50:12,672 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 12:50:12,672 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 12:50:12,699 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_12183be7-2fee-48ba-a9e1-8aee4cbc88ad/bin-2019/utaipan/witness.graphml [2018-12-09 12:50:12,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:50:12,700 INFO L168 Benchmark]: Toolchain (without parser) took 6013.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.0 MB in the beginning and 863.9 MB in the end (delta: 83.1 MB). Peak memory consumption was 230.9 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,700 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:50:12,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:50:12,701 INFO L168 Benchmark]: Boogie Preprocessor took 14.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,701 INFO L168 Benchmark]: RCFGBuilder took 196.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,701 INFO L168 Benchmark]: TraceAbstraction took 5498.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 869.3 MB in the end (delta: 186.6 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,702 INFO L168 Benchmark]: Witness Printer took 45.00 ms. Allocated memory is still 1.2 GB. Free memory was 869.3 MB in the beginning and 863.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:50:12,703 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 196.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5498.34 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.1 MB). Free memory was 1.1 GB in the beginning and 869.3 MB in the end (delta: 186.6 MB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.00 ms. Allocated memory is still 1.2 GB. Free memory was 869.3 MB in the beginning and 863.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 640]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 631]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 634]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 628]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 21 error locations. SAFE Result, 5.4s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 233 SDslu, 954 SDs, 0 SdLazy, 1789 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 64727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...