./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer --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 d452f938d74713dbff7e0330f8ef393409d67ffe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:59:37,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:59:37,007 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:59:37,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:59:37,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:59:37,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:59:37,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:59:37,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:59:37,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:59:37,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:59:37,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:59:37,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:59:37,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:59:37,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:59:37,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:59:37,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:59:37,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:59:37,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:59:37,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:59:37,026 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:59:37,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:59:37,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:59:37,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:59:37,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:59:37,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:59:37,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:59:37,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:59:37,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:59:37,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:59:37,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:59:37,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:59:37,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:59:37,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:59:37,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:59:37,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:59:37,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:59:37,037 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-22 22:59:37,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:59:37,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:59:37,046 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:59:37,047 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:59:37,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:59:37,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:59:37,047 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:59:37,047 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:59:37,047 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:59:37,048 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:59:37,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:59:37,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:59:37,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:59:37,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:59:37,050 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:59:37,050 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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 -> d452f938d74713dbff7e0330f8ef393409d67ffe [2018-11-22 22:59:37,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:59:37,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:59:37,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:59:37,086 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:59:37,086 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:59:37,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c [2018-11-22 22:59:37,121 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/data/dc90bab67/3732473e9443434c82634250fc174161/FLAG2fd6a56b4 [2018-11-22 22:59:37,418 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:59:37,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/sv-benchmarks/c/memsafety-ext3/derefAfterFree1_false-valid-deref.c [2018-11-22 22:59:37,422 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/data/dc90bab67/3732473e9443434c82634250fc174161/FLAG2fd6a56b4 [2018-11-22 22:59:37,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/data/dc90bab67/3732473e9443434c82634250fc174161 [2018-11-22 22:59:37,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:59:37,434 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-22 22:59:37,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:59:37,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:59:37,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:59:37,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d4648b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37, skipping insertion in model container [2018-11-22 22:59:37,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:59:37,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:59:37,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:59:37,560 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:59:37,568 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:59:37,578 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:59:37,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37 WrapperNode [2018-11-22 22:59:37,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:59:37,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:59:37,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:59:37,579 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:59:37,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... [2018-11-22 22:59:37,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:59:37,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:59:37,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:59:37,600 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:59:37,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/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-11-22 22:59:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:59:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:59:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure freePointer [2018-11-22 22:59:37,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:59:37,674 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-22 22:59:37,674 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-22 22:59:37,674 INFO L130 BoogieDeclarations]: Found specification of procedure freePointer [2018-11-22 22:59:37,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:59:37,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:59:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:59:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:59:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:59:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:59:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:59:37,790 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:59:37,791 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 22:59:37,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:59:37 BoogieIcfgContainer [2018-11-22 22:59:37,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:59:37,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:59:37,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:59:37,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:59:37,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:59:37" (1/3) ... [2018-11-22 22:59:37,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0aa4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:59:37, skipping insertion in model container [2018-11-22 22:59:37,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:59:37" (2/3) ... [2018-11-22 22:59:37,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0aa4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:59:37, skipping insertion in model container [2018-11-22 22:59:37,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:59:37" (3/3) ... [2018-11-22 22:59:37,797 INFO L112 eAbstractionObserver]: Analyzing ICFG derefAfterFree1_false-valid-deref.c [2018-11-22 22:59:37,806 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:59:37,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-11-22 22:59:37,828 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-11-22 22:59:37,850 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:59:37,851 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:59:37,851 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-22 22:59:37,851 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:59:37,851 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:59:37,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:59:37,851 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:59:37,852 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:59:37,852 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:59:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-22 22:59:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:59:37,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:59:37,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:59:37,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-22 22:59:37,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:59:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash -96564575, now seen corresponding path program 1 times [2018-11-22 22:59:37,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:59:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:59:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:37,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:59:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:59:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:59:38,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:59:38,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:59:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:59:38,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:59:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:59:38,056 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-11-22 22:59:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:59:38,104 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2018-11-22 22:59:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:59:38,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-22 22:59:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:59:38,111 INFO L225 Difference]: With dead ends: 22 [2018-11-22 22:59:38,111 INFO L226 Difference]: Without dead ends: 19 [2018-11-22 22:59:38,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:59:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-22 22:59:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-22 22:59:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 22:59:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2018-11-22 22:59:38,138 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 9 [2018-11-22 22:59:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:59:38,139 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2018-11-22 22:59:38,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:59:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2018-11-22 22:59:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 22:59:38,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:59:38,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:59:38,140 INFO L423 AbstractCegarLoop]: === Iteration 2 === [freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-22 22:59:38,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:59:38,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1301465505, now seen corresponding path program 1 times [2018-11-22 22:59:38,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:59:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:59:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:38,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:59:38,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:59:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:59:38,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:59:38,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:59:38,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:59:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:59:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:59:38,197 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 5 states. [2018-11-22 22:59:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:59:38,241 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-22 22:59:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:59:38,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-22 22:59:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:59:38,242 INFO L225 Difference]: With dead ends: 18 [2018-11-22 22:59:38,242 INFO L226 Difference]: Without dead ends: 18 [2018-11-22 22:59:38,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:59:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-22 22:59:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 22:59:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 22:59:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-22 22:59:38,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 10 [2018-11-22 22:59:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:59:38,247 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-22 22:59:38,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:59:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-22 22:59:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:59:38,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:59:38,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:59:38,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [freePointerErr0ASSERT_VIOLATIONMEMORY_FREE, freePointerErr1ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-22 22:59:38,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:59:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1289113817, now seen corresponding path program 1 times [2018-11-22 22:59:38,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:59:38,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:59:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:38,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:59:38,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:59:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:59:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:59:38,284 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] RET #20#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.base || 1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume true; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] RET #24#return; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 ----- [2018-11-22 22:59:38,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:59:38 BoogieIcfgContainer [2018-11-22 22:59:38,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:59:38,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:59:38,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:59:38,304 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:59:38,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:59:37" (3/4) ... [2018-11-22 22:59:38,306 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=43, |#NULL.offset|=41, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=43, |old(#NULL.offset)|=41] [?] RET #20#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret3 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40);~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.offset; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume 0 == ~p.base || 1 == #valid[~p.base];call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] assume true; VAL [freePointer_~p.base=42, freePointer_~p.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |freePointer_#in~p.base|=42, |freePointer_#in~p.offset|=0] [?] RET #24#return; VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc2.base|=42, |main_#t~malloc2.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=43, #NULL.offset=41, old(#NULL.base)=43, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=43, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L10] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(40); [L10] ~p~0.base, ~p~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L12] CALL call freePointer(~p~0.base, ~p~0.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0] [L5-L7] ~p.base, ~p.offset := #in~p.base, #in~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.offset; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L6] assert 0 == ~p.base || 1 == #valid[~p.base]; [L6] call ULTIMATE.dealloc(~p.base, ~p.offset); VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L5-L7] ensures true; VAL [#in~p.base=42, #in~p.offset=0, #NULL.base=0, #NULL.offset=0, ~p.base=42, ~p.offset=0] [L12] RET call freePointer(~p~0.base, ~p~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [L14] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc2.base=42, #t~malloc2.offset=0, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=43, #NULL!offset=41, old(#NULL!base)=43, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=43, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret3 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L10] FCALL call #t~malloc2 := #Ultimate.alloc(40); [L10] ~p~0 := #t~malloc2; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L12] CALL call freePointer(~p~0); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0] [L5-L7] ~p := #in~p; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!offset; VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L6] assert 0 == ~p!base || 1 == #valid[~p!base]; [L6] FCALL call ULTIMATE.dealloc(~p); VAL [#in~p!base=42, #in~p!offset=0, #NULL!base=0, #NULL!offset=0, ~p!base=42, ~p!offset=0] [L12] RET call freePointer(~p~0); VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L14] FCALL call write~int(1, { base: ~p~0!base, offset: ~p~0!offset }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc2!base=42, #t~malloc2!offset=0, ~p~0!base=42, ~p~0!offset=0] [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 ----- [2018-11-22 22:59:38,337 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ffd05794-bd8a-499f-8294-09919cff4d2d/bin-2019/uautomizer/witness.graphml [2018-11-22 22:59:38,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:59:38,338 INFO L168 Benchmark]: Toolchain (without parser) took 904.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -96.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,339 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:59:38,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,340 INFO L168 Benchmark]: Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,340 INFO L168 Benchmark]: RCFGBuilder took 191.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,340 INFO L168 Benchmark]: TraceAbstraction took 512.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,341 INFO L168 Benchmark]: Witness Printer took 33.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:59:38,342 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.18 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 191.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 512.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 33.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int* p = malloc(10 * sizeof(int)); VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L12] CALL freePointer(p) VAL [p={42:0}] [L6] free(p) VAL [p={42:0}, p={42:0}] [L6] free(p) [L12] RET freePointer(p) VAL [malloc(10 * sizeof(int))={42:0}, p={42:0}] [L14] p[0] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 5 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 19 SDslu, 58 SDs, 0 SdLazy, 36 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...