./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_false-valid-free.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --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.24-2e94e6a [2019-01-01 17:14:46,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 17:14:46,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 17:14:46,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 17:14:46,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 17:14:46,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 17:14:46,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 17:14:46,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 17:14:46,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 17:14:46,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 17:14:46,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 17:14:46,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 17:14:46,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 17:14:46,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 17:14:46,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 17:14:46,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 17:14:46,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 17:14:46,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 17:14:46,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 17:14:46,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 17:14:46,684 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 17:14:46,686 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 17:14:46,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 17:14:46,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 17:14:46,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 17:14:46,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 17:14:46,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 17:14:46,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 17:14:46,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 17:14:46,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 17:14:46,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 17:14:46,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 17:14:46,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 17:14:46,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 17:14:46,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 17:14:46,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 17:14:46,700 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 17:14:46,718 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 17:14:46,719 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 17:14:46,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 17:14:46,721 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 17:14:46,721 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 17:14:46,721 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 17:14:46,721 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 17:14:46,721 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 17:14:46,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 17:14:46,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 17:14:46,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 17:14:46,725 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 17:14:46,726 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 17:14:46,726 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 17:14:46,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 17:14:46,726 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 17:14:46,726 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 17:14:46,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 17:14:46,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 17:14:46,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 17:14:46,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 17:14:46,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:14:46,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 17:14:46,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 17:14:46,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 17:14:46,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 17:14:46,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ded1caa2f8c25b2d12db952d692e8b8fb2437d41 [2019-01-01 17:14:46,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 17:14:46,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 17:14:46,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 17:14:46,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 17:14:46,798 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 17:14:46,799 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_false-valid-free.i [2019-01-01 17:14:46,874 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db915c53f/af4b887538ab4fba9dd18edcf3757934/FLAGbe38fe860 [2019-01-01 17:14:47,447 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 17:14:47,448 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety-realloc/array-realloc_false-valid-free.i [2019-01-01 17:14:47,471 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db915c53f/af4b887538ab4fba9dd18edcf3757934/FLAGbe38fe860 [2019-01-01 17:14:47,696 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db915c53f/af4b887538ab4fba9dd18edcf3757934 [2019-01-01 17:14:47,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 17:14:47,700 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 17:14:47,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:47,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 17:14:47,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 17:14:47,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:47" (1/1) ... [2019-01-01 17:14:47,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18240abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:47, skipping insertion in model container [2019-01-01 17:14:47,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 05:14:47" (1/1) ... [2019-01-01 17:14:47,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 17:14:47,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 17:14:48,193 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:48,217 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 17:14:48,359 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 17:14:48,422 INFO L195 MainTranslator]: Completed translation [2019-01-01 17:14:48,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48 WrapperNode [2019-01-01 17:14:48,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 17:14:48,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 17:14:48,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 17:14:48,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 17:14:48,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... [2019-01-01 17:14:48,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 17:14:48,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 17:14:48,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 17:14:48,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 17:14:48,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 17:14:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 17:14:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 17:14:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 17:14:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 17:14:48,573 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-01-01 17:14:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 17:14:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-01-01 17:14:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 17:14:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 17:14:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 17:14:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 17:14:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 17:14:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 17:14:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 17:14:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 17:14:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 17:14:48,576 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 17:14:48,577 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 17:14:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 17:14:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 17:14:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 17:14:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 17:14:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 17:14:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 17:14:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 17:14:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 17:14:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 17:14:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 17:14:48,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 17:14:48,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 17:14:48,586 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 17:14:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 17:14:48,589 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 17:14:48,590 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 17:14:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 17:14:48,592 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 17:14:48,593 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 17:14:48,594 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 17:14:48,595 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 17:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 17:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 17:14:48,598 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 17:14:48,599 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 17:14:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-01 17:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-01-01 17:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-01-01 17:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 17:14:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 17:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 17:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 17:14:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 17:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 17:14:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 17:14:49,241 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 17:14:49,241 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-01 17:14:49,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:49 BoogieIcfgContainer [2019-01-01 17:14:49,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 17:14:49,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 17:14:49,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 17:14:49,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 17:14:49,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 05:14:47" (1/3) ... [2019-01-01 17:14:49,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8170bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:49, skipping insertion in model container [2019-01-01 17:14:49,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 05:14:48" (2/3) ... [2019-01-01 17:14:49,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8170bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 05:14:49, skipping insertion in model container [2019-01-01 17:14:49,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:49" (3/3) ... [2019-01-01 17:14:49,253 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc_false-valid-free.i [2019-01-01 17:14:49,264 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 17:14:49,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-01 17:14:49,296 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-01 17:14:49,329 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 17:14:49,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 17:14:49,330 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 17:14:49,331 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 17:14:49,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 17:14:49,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 17:14:49,332 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 17:14:49,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 17:14:49,333 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 17:14:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-01-01 17:14:49,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-01 17:14:49,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:49,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:49,372 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1600794211, now seen corresponding path program 1 times [2019-01-01 17:14:49,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:49,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:49,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:49,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:49,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:49,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:49,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:49,588 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-01-01 17:14:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:49,727 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-01-01 17:14:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:49,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-01 17:14:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:49,738 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:14:49,738 INFO L226 Difference]: Without dead ends: 37 [2019-01-01 17:14:49,740 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 [2019-01-01 17:14:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-01 17:14:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-01-01 17:14:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:14:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-01 17:14:49,785 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 8 [2019-01-01 17:14:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:49,785 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-01 17:14:49,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-01 17:14:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 17:14:49,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:49,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:49,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:49,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1914987658, now seen corresponding path program 1 times [2019-01-01 17:14:49,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:49,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:49,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:49,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 17:14:49,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:49,866 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 3 states. [2019-01-01 17:14:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:49,917 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-01 17:14:49,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:49,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 17:14:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:49,918 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:14:49,918 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:14:49,919 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 [2019-01-01 17:14:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:14:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:14:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:14:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-01 17:14:49,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2019-01-01 17:14:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:49,926 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-01 17:14:49,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-01 17:14:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 17:14:49,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:49,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:49,927 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 585007852, now seen corresponding path program 1 times [2019-01-01 17:14:49,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:50,155 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-01-01 17:14:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:50,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:50,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:50,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:14:50,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:14:50,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:50,313 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 6 states. [2019-01-01 17:14:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:50,564 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-01 17:14:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:14:50,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-01 17:14:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:50,567 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:14:50,567 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:14:50,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:14:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:14:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:14:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:14:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-01 17:14:50,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 16 [2019-01-01 17:14:50,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:50,574 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-01 17:14:50,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:14:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-01 17:14:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:14:50,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:50,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:50,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1348980882, now seen corresponding path program 1 times [2019-01-01 17:14:50,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:50,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:50,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:50,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:50,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:50,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 17:14:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 17:14:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 17:14:50,786 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 6 states. [2019-01-01 17:14:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:51,149 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-01-01 17:14:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 17:14:51,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-01 17:14:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:51,152 INFO L225 Difference]: With dead ends: 41 [2019-01-01 17:14:51,152 INFO L226 Difference]: Without dead ends: 41 [2019-01-01 17:14:51,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:14:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-01 17:14:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2019-01-01 17:14:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 17:14:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-01 17:14:51,160 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 17 [2019-01-01 17:14:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:51,161 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-01 17:14:51,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 17:14:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-01-01 17:14:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:14:51,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:51,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:51,163 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1348057361, now seen corresponding path program 1 times [2019-01-01 17:14:51,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:51,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:51,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:51,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 17:14:51,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 17:14:51,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 17:14:51,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 17:14:51,294 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2019-01-01 17:14:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:51,386 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-01-01 17:14:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 17:14:51,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-01 17:14:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:51,389 INFO L225 Difference]: With dead ends: 35 [2019-01-01 17:14:51,389 INFO L226 Difference]: Without dead ends: 35 [2019-01-01 17:14:51,390 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 [2019-01-01 17:14:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-01 17:14:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-01 17:14:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 17:14:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-01 17:14:51,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 17 [2019-01-01 17:14:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:51,396 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-01 17:14:51,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 17:14:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-01 17:14:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-01 17:14:51,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:51,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 17:14:51,398 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:51,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1348057360, now seen corresponding path program 1 times [2019-01-01 17:14:51,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 17:14:51,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:51,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 17:14:51,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 17:14:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 17:14:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 17:14:51,587 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 7 states. [2019-01-01 17:14:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:51,763 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-01 17:14:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 17:14:51,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-01 17:14:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:51,766 INFO L225 Difference]: With dead ends: 34 [2019-01-01 17:14:51,766 INFO L226 Difference]: Without dead ends: 34 [2019-01-01 17:14:51,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 17:14:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-01 17:14:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 17:14:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 17:14:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-01-01 17:14:51,775 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 17 [2019-01-01 17:14:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:51,775 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-01-01 17:14:51,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 17:14:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-01-01 17:14:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-01 17:14:51,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:51,777 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] [2019-01-01 17:14:51,777 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash -800508335, now seen corresponding path program 1 times [2019-01-01 17:14:51,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:51,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:14:51,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:51,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:51,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:51,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:51,837 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 3 states. [2019-01-01 17:14:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:51,851 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-01 17:14:51,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:51,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-01 17:14:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:51,855 INFO L225 Difference]: With dead ends: 33 [2019-01-01 17:14:51,855 INFO L226 Difference]: Without dead ends: 33 [2019-01-01 17:14:51,855 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 [2019-01-01 17:14:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-01 17:14:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-01 17:14:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 17:14:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-01 17:14:51,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 24 [2019-01-01 17:14:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:51,860 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-01 17:14:51,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-01 17:14:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-01 17:14:51,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:51,864 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] [2019-01-01 17:14:51,864 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 954045444, now seen corresponding path program 1 times [2019-01-01 17:14:51,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:51,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:51,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:51,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 17:14:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 17:14:51,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 17:14:51,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 17:14:51,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 17:14:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 17:14:51,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 17:14:51,960 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2019-01-01 17:14:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 17:14:52,009 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-01-01 17:14:52,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 17:14:52,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-01 17:14:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 17:14:52,011 INFO L225 Difference]: With dead ends: 32 [2019-01-01 17:14:52,011 INFO L226 Difference]: Without dead ends: 32 [2019-01-01 17:14:52,012 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 [2019-01-01 17:14:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-01 17:14:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-01 17:14:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-01 17:14:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-01-01 17:14:52,017 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2019-01-01 17:14:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 17:14:52,018 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-01-01 17:14:52,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 17:14:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-01-01 17:14:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-01 17:14:52,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 17:14:52,020 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] [2019-01-01 17:14:52,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ENSURES_VIOLATIONMEMORY_LEAK, mainErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr0ASSERT_VIOLATIONMEMORY_FREE, mainErr2ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION]=== [2019-01-01 17:14:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 17:14:52,021 INFO L82 PathProgramCache]: Analyzing trace with hash -489362253, now seen corresponding path program 1 times [2019-01-01 17:14:52,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 17:14:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 17:14:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:52,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 17:14:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 17:14:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:14:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 17:14:52,117 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-01 17:14:52,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 05:14:52 BoogieIcfgContainer [2019-01-01 17:14:52,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 17:14:52,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 17:14:52,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 17:14:52,162 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 17:14:52,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 05:14:49" (3/4) ... [2019-01-01 17:14:52,167 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-01 17:14:52,248 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 17:14:52,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 17:14:52,250 INFO L168 Benchmark]: Toolchain (without parser) took 4550.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 946.0 MB in the beginning and 954.1 MB in the end (delta: -8.1 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:52,251 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:52,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 722.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:52,258 INFO L168 Benchmark]: Boogie Preprocessor took 78.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:52,259 INFO L168 Benchmark]: RCFGBuilder took 738.65 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:52,260 INFO L168 Benchmark]: TraceAbstraction took 2917.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.1 MB in the end (delta: 127.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. [2019-01-01 17:14:52,260 INFO L168 Benchmark]: Witness Printer took 87.13 ms. Allocated memory is still 1.2 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 17:14:52,270 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 722.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.87 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 738.65 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2917.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 954.1 MB in the end (delta: 127.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 11.5 GB. * Witness Printer took 87.13 ms. Allocated memory is still 1.2 GB. Free memory is still 954.1 MB. There was no memory consumed. 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)=9, \old(ind)=7, \old(newsize)=11, \old(num)=8, 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)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=0, num=1] [L575] COND FALSE !(a == ((void *)0)) [L578] newsize = 0 VAL [\old(argc)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=0, num=1] [L579] CALL expandArray(a) VAL [\old(newsize)=0, \old(num)=0, arg={-1:0}, i=1, ind=0, newsize=0, num=1] [L559] int *a = (int *)arg; VAL [\old(newsize)=0, \old(num)=0, a={-1:0}, arg={-1:0}, arg={-1: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={-1:0}, arg={-1:0}, arg={-1: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={-1:0}, arg={-1:0}, arg={-1:0}, b={0:0}, i=1, ind=0, newsize=1, num=1, realloc(a, sizeof(int) * newsize)={2:0}] [L563] b = realloc(a, sizeof(int) * newsize) [L564] b[newsize - 1] = i VAL [\old(newsize)=0, \old(num)=0, a={-1:0}, arg={-1:0}, arg={-1:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L565] a = b VAL [\old(newsize)=0, \old(num)=0, a={2:0}, arg={-1:0}, arg={-1:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L560] COND FALSE !(newsize < num) VAL [\old(newsize)=0, \old(num)=0, a={2:0}, arg={-1:0}, arg={-1:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L567] return 0; VAL [\old(newsize)=0, \old(num)=0, \result={0:0}, a={2:0}, arg={-1:0}, arg={-1:0}, b={2:0}, i=1, ind=0, newsize=1, num=1] [L579] RET expandArray(a) VAL [\old(argc)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, expandArray(a)={0:0}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=1, num=1] [L580] free(a) VAL [\old(argc)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=1, num=1] [L580] free(a) VAL [\old(argc)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=1, num=1] [L580] free(a) VAL [\old(argc)=13, \old(newsize)=0, \old(num)=0, a={-1:0}, argc=13, argv={10:6}, argv={10:6}, i=1, ind=0, malloc(sizeof(int))={-1:0}, newsize=1, num=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 41 locations, 6 error locations. UNSAFE Result, 2.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 225 SDtfs, 119 SDslu, 319 SDs, 0 SdLazy, 189 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 4916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...