./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc_false-valid-free.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_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety-realloc/array-realloc_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/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 ded1caa2f8c25b2d12db952d692e8b8fb2437d41 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.23-635dfa2 [2018-12-08 18:39:09,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:39:09,958 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:39:09,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:39:09,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:39:09,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:39:09,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:39:09,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:39:09,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:39:09,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:39:09,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:39:09,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:39:09,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:39:09,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:39:09,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:39:09,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:39:09,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:39:09,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:39:09,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:39:09,973 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:39:09,974 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:39:09,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:39:09,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:39:09,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:39:09,976 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:39:09,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:39:09,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:39:09,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:39:09,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:39:09,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:39:09,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:39:09,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:39:09,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:39:09,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:39:09,979 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:39:09,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:39:09,980 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 18:39:09,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:39:09,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:39:09,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:39:09,988 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:39:09,989 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 18:39:09,989 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:39:09,990 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 18:39:09,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 18:39:09,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:39:09,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:39:09,990 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 18:39:09,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 18:39:09,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:39:09,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:39:09,991 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:39:09,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:39:09,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:39:09,992 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 18:39:09,992 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:39:09,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 18:39:09,992 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_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/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 -> ded1caa2f8c25b2d12db952d692e8b8fb2437d41 [2018-12-08 18:39:10,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:39:10,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:39:10,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:39:10,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:39:10,023 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:39:10,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety-realloc/array-realloc_false-valid-free.i [2018-12-08 18:39:10,070 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/data/fb8ea1a9f/1d10d89bf21245068c4e049fc2fd76ca/FLAG543f75a3f [2018-12-08 18:39:10,491 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:39:10,491 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/sv-benchmarks/c/array-memsafety-realloc/array-realloc_false-valid-free.i [2018-12-08 18:39:10,498 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/data/fb8ea1a9f/1d10d89bf21245068c4e049fc2fd76ca/FLAG543f75a3f [2018-12-08 18:39:10,505 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/data/fb8ea1a9f/1d10d89bf21245068c4e049fc2fd76ca [2018-12-08 18:39:10,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:39:10,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:39:10,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:39:10,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:39:10,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:39:10,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e31f4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10, skipping insertion in model container [2018-12-08 18:39:10,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:39:10,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:39:10,675 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:39:10,684 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:39:10,754 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:39:10,773 INFO L195 MainTranslator]: Completed translation [2018-12-08 18:39:10,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10 WrapperNode [2018-12-08 18:39:10,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 18:39:10,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 18:39:10,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 18:39:10,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 18:39:10,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 18:39:10,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 18:39:10,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 18:39:10,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 18:39:10,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... [2018-12-08 18:39:10,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 18:39:10,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 18:39:10,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 18:39:10,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 18:39:10,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/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-08 18:39:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2018-12-08 18:39:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 18:39:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 18:39:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2018-12-08 18:39:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 18:39:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 18:39:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 18:39:10,974 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 18:39:10,974 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 18:39:10,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:39:10 BoogieIcfgContainer [2018-12-08 18:39:10,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 18:39:10,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 18:39:10,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 18:39:10,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 18:39:10,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 06:39:10" (1/3) ... [2018-12-08 18:39:10,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fff82af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:39:10, skipping insertion in model container [2018-12-08 18:39:10,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:39:10" (2/3) ... [2018-12-08 18:39:10,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fff82af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:39:10, skipping insertion in model container [2018-12-08 18:39:10,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:39:10" (3/3) ... [2018-12-08 18:39:10,979 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc_false-valid-free.i [2018-12-08 18:39:10,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 18:39:10,989 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-08 18:39:10,999 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-08 18:39:11,014 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 18:39:11,014 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 18:39:11,014 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 18:39:11,014 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 18:39:11,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 18:39:11,015 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 18:39:11,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 18:39:11,015 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 18:39:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-08 18:39:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 18:39:11,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,031 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 604141126, now seen corresponding path program 1 times [2018-12-08 18:39:11,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,130 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-08 18:39:11,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 18:39:11,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:39:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:39:11,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:39:11,143 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-12-08 18:39:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,193 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-08 18:39:11,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:39:11,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-08 18:39:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,200 INFO L225 Difference]: With dead ends: 39 [2018-12-08 18:39:11,200 INFO L226 Difference]: Without dead ends: 35 [2018-12-08 18:39:11,201 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-08 18:39:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-08 18:39:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-12-08 18:39:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 18:39:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-08 18:39:11,224 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2018-12-08 18:39:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,224 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-08 18:39:11,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:39:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-08 18:39:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 18:39:11,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,225 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1548506430, now seen corresponding path program 1 times [2018-12-08 18:39:11,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,250 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-08 18:39:11,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:39:11,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:39:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:39:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:39:11,252 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 3 states. [2018-12-08 18:39:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,257 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-08 18:39:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:39:11,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 18:39:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,258 INFO L225 Difference]: With dead ends: 30 [2018-12-08 18:39:11,258 INFO L226 Difference]: Without dead ends: 30 [2018-12-08 18:39:11,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 18:39:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-08 18:39:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-08 18:39:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-08 18:39:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-08 18:39:11,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 9 [2018-12-08 18:39:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,261 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-08 18:39:11,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:39:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-08 18:39:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 18:39:11,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,261 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1420905399, now seen corresponding path program 1 times [2018-12-08 18:39:11,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,325 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-08 18:39:11,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:39:11,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:39:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:39:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:39:11,326 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-12-08 18:39:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,376 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-08 18:39:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 18:39:11,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-08 18:39:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,377 INFO L225 Difference]: With dead ends: 31 [2018-12-08 18:39:11,377 INFO L226 Difference]: Without dead ends: 31 [2018-12-08 18:39:11,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 18:39:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-08 18:39:11,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-08 18:39:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 18:39:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-08 18:39:11,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 16 [2018-12-08 18:39:11,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,380 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-08 18:39:11,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:39:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-08 18:39:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 18:39:11,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,381 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1235516319, now seen corresponding path program 1 times [2018-12-08 18:39:11,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,425 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-08 18:39:11,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:39:11,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:39:11,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:39:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:39:11,426 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-12-08 18:39:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,449 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-08 18:39:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:39:11,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-08 18:39:11,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,450 INFO L225 Difference]: With dead ends: 39 [2018-12-08 18:39:11,450 INFO L226 Difference]: Without dead ends: 39 [2018-12-08 18:39:11,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:39:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-08 18:39:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-12-08 18:39:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-08 18:39:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-08 18:39:11,453 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 17 [2018-12-08 18:39:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,454 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-08 18:39:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:39:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-08 18:39:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 18:39:11,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1234592798, now seen corresponding path program 1 times [2018-12-08 18:39:11,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,481 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-08 18:39:11,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:39:11,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:39:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:39:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:39:11,482 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 5 states. [2018-12-08 18:39:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,510 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-08 18:39:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:39:11,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-08 18:39:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,511 INFO L225 Difference]: With dead ends: 33 [2018-12-08 18:39:11,511 INFO L226 Difference]: Without dead ends: 33 [2018-12-08 18:39:11,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:39:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-08 18:39:11,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-08 18:39:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 18:39:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-08 18:39:11,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 17 [2018-12-08 18:39:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,514 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-08 18:39:11,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:39:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-08 18:39:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 18:39:11,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:39:11,515 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1234592797, now seen corresponding path program 1 times [2018-12-08 18:39:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,563 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-08 18:39:11,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:39:11,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 18:39:11,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 18:39:11,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:39:11,564 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 7 states. [2018-12-08 18:39:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,604 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-08 18:39:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 18:39:11,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-08 18:39:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,605 INFO L225 Difference]: With dead ends: 32 [2018-12-08 18:39:11,605 INFO L226 Difference]: Without dead ends: 32 [2018-12-08 18:39:11,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 18:39:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-08 18:39:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-08 18:39:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 18:39:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-08 18:39:11,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 17 [2018-12-08 18:39:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,608 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-08 18:39:11,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 18:39:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-08 18:39:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 18:39:11,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,609 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] [2018-12-08 18:39:11,609 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2129875676, now seen corresponding path program 1 times [2018-12-08 18:39:11,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:39:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 18:39:11,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:39:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 18:39:11,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:39:11,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:39:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:39:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:39:11,629 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 3 states. [2018-12-08 18:39:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:39:11,632 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-12-08 18:39:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:39:11,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-08 18:39:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:39:11,633 INFO L225 Difference]: With dead ends: 31 [2018-12-08 18:39:11,633 INFO L226 Difference]: Without dead ends: 31 [2018-12-08 18:39:11,633 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-08 18:39:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-08 18:39:11,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-08 18:39:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 18:39:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-08 18:39:11,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2018-12-08 18:39:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:39:11,636 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-08 18:39:11,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:39:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-08 18:39:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 18:39:11,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:39:11,637 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-08 18:39:11,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr1ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2018-12-08 18:39:11,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:39:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1601636570, now seen corresponding path program 1 times [2018-12-08 18:39:11,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:39:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:39:11,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:39:11,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:39:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:39:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 18:39:11,671 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 18:39:11,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 06:39:11 BoogieIcfgContainer [2018-12-08 18:39:11,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 18:39:11,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 18:39:11,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 18:39:11,695 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 18:39:11,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:39:10" (3/4) ... [2018-12-08 18:39:11,697 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 18:39:11,729 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b216fd5-e87f-4bdd-ba4f-21bbe7dddcab/bin-2019/utaipan/witness.graphml [2018-12-08 18:39:11,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 18:39:11,729 INFO L168 Benchmark]: Toolchain (without parser) took 1221.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.1 MB in the beginning and 993.2 MB in the end (delta: -45.1 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,730 INFO L168 Benchmark]: CDTParser took 0.19 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-08 18:39:11,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,731 INFO L168 Benchmark]: Boogie Preprocessor took 16.81 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. [2018-12-08 18:39:11,731 INFO L168 Benchmark]: RCFGBuilder took 164.75 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,732 INFO L168 Benchmark]: TraceAbstraction took 719.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,732 INFO L168 Benchmark]: Witness Printer took 34.21 ms. Allocated memory is still 1.2 GB. Free memory was 996.6 MB in the beginning and 993.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-08 18:39:11,734 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.19 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 265.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.22 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.81 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 164.75 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 719.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.6 MB in the end (delta: 120.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. * Witness Printer took 34.21 ms. Allocated memory is still 1.2 GB. Free memory was 996.6 MB in the beginning and 993.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 580]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L556] int num; [L557] int ind, newsize, i = 1; VAL [\old(i)=10, \old(ind)=8, \old(newsize)=13, \old(num)=9, i=1, ind=0, newsize=0, num=0] [L570] num = __VERIFIER_nondet_int() [L571] COND FALSE !(!(num > 0 && num < 100)) [L574] int *a = (int *)malloc(sizeof(int)); VAL [\old(argc)=15, \old(newsize)=0, \old(num)=0, a={11:0}, argc=15, argv={12:6}, argv={12:6}, i=1, ind=0, malloc(sizeof(int))={11:0}, newsize=0, num=1] [L575] COND FALSE !(a == ((void *)0)) [L578] newsize = 0 VAL [\old(argc)=15, \old(newsize)=0, \old(num)=0, a={11:0}, argc=15, argv={12:6}, argv={12:6}, i=1, ind=0, malloc(sizeof(int))={11:0}, newsize=0, num=1] [L579] CALL expandArray(a) VAL [\old(newsize)=0, \old(num)=0, arg={11:0}, i=1, ind=0, newsize=0, num=1] [L559] int *a = (int *)arg; VAL [\old(newsize)=0, \old(num)=0, a={11:0}, arg={11:0}, arg={11:0}, i=1, ind=0, newsize=0, num=1] [L560] COND TRUE newsize < num [L561] newsize = newsize + 1 [L562] int *b = ((void *)0); VAL [\old(newsize)=0, \old(num)=0, a={11:0}, arg={11:0}, arg={11:0}, b={0:0}, i=1, ind=0, newsize=1, num=1] [L563] EXPR, FCALL realloc(a, sizeof(int) * newsize) VAL [\old(newsize)=0, \old(num)=0, a={11:0}, arg={11:0}, arg={11:0}, b={0:0}, i=1, ind=0, newsize=1, num=1, realloc(a, sizeof(int) * newsize)={7:0}] [L563] b = realloc(a, sizeof(int) * newsize) [L564] b[newsize - 1] = i VAL [\old(newsize)=0, \old(num)=0, a={11:0}, arg={11:0}, arg={11:0}, b={7:0}, i=1, ind=0, newsize=1, num=1] [L565] a = b VAL [\old(newsize)=0, \old(num)=0, a={7:0}, arg={11:0}, arg={11:0}, b={7:0}, i=1, ind=0, newsize=1, num=1] [L560] COND FALSE !(newsize < num) VAL [\old(newsize)=0, \old(num)=0, a={7:0}, arg={11:0}, arg={11:0}, b={7:0}, i=1, ind=0, newsize=1, num=1] [L567] return 0; VAL [\old(newsize)=0, \old(num)=0, \result={0:0}, a={7:0}, arg={11:0}, arg={11:0}, b={7:0}, i=1, ind=0, newsize=1, num=1] [L579] RET expandArray(a) VAL [\old(argc)=15, \old(newsize)=0, \old(num)=0, a={11:0}, argc=15, argv={12:6}, argv={12:6}, expandArray(a)={0:0}, i=1, ind=0, malloc(sizeof(int))={11:0}, newsize=1, num=1] [L580] free(a) VAL [\old(argc)=15, \old(newsize)=0, \old(num)=0, a={11:0}, argc=15, argv={12:6}, argv={12:6}, i=1, ind=0, malloc(sizeof(int))={11:0}, newsize=1, num=1] [L580] free(a) VAL [\old(argc)=15, \old(newsize)=0, \old(num)=0, a={11:0}, argc=15, argv={12:6}, argv={12:6}, i=1, ind=0, malloc(sizeof(int))={11:0}, newsize=1, num=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 5 error locations. UNSAFE Result, 0.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 100 SDslu, 288 SDs, 0 SdLazy, 184 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, 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, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 3860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...